1 code implementation • 30 Sep 2009 • Nikolaj Leischner, Vitaly Osipov, Peter Sanders
For uniformly distributed keys our sample sort is at least 25% and on average 68% faster than the best comparison-based sorting algorithm, GPU Thrust merge sort, and on average more than 2 times faster than GPU quicksort.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
