1 paper
Vipul Harsh, Laxmikant Kale, Edgar Solomonik
To minimize data movement, state-of-the-art parallel sorting algorithms use techniques based on sampling and histogramming to partition keys prior to redistribution. Sampling enabl…