Parallel String Sample Sort

  • Timo Bingmann
  • Peter Sanders
Conference paper

DOI: 10.1007/978-3-642-40450-4_15

Volume 8125 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bingmann T., Sanders P. (2013) Parallel String Sample Sort. In: Bodlaender H.L., Italiano G.F. (eds) Algorithms – ESA 2013. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Timo Bingmann
    • 1
  • Peter Sanders
    • 1
  1. 1.Karlsruhe Institute of TechnologyKarlsruheGermany