2013/05/06 by Timo Bingmann, Peter Sanders, Bingmann, Timo +1 · 1 citation
Computer Science · #D.1.3 #Data Structures and Algorithms (cs.DS) #Distributed #E.5 #F.2.2 #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.DS
paper · pdf · doi:10.48550/arxiv.1305.1157
34 pages, 7 figures and 12 tables
arxiv created 2013/05/06 · arxiv updated 2013/05/07
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.