Parallel String Sample Sort [chapter]

Timo Bingmann, Peter Sanders
2013 Lecture Notes in Computer Science  
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we propose string sample sort. The algorithm makes effective use of the memory hierarchy, uses additional word level parallelism, and largely avoids branch mispredictions. Additionally, we parallelize variants of multikey quicksort and radix sort that are also useful in certain situations.
doi:10.1007/978-3-642-40450-4_15 fatcat:sgqzjbzmtbddtf326cqlnnu2iy