Chapter

Algorithms – ESA 2013

Volume 8125 of the series Lecture Notes in Computer Science pp 169-180

Parallel String Sample Sort

  • Timo BingmannAffiliated withLancaster UniversityKarlsruhe Institute of Technology
  • , Peter SandersAffiliated withLancaster UniversityKarlsruhe Institute of Technology

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.