Algorithmica

, Volume 77, Issue 1, pp 235–286

Engineering Parallel String Sorting

Article

DOI: 10.1007/s00453-015-0071-1

Cite this article as:
Bingmann, T., Eberle, A. & Sanders, P. Algorithmica (2017) 77: 235. doi:10.1007/s00453-015-0071-1
  • 198 Downloads

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 first propose string sample sort. The algorithm makes effective use of the memory hierarchy, uses additional word level parallelism, and largely avoids branch mispredictions. Then we focus on NUMA architectures, and develop parallel multiway LCP-merge and -mergesort to reduce the number of random memory accesses to remote nodes. Additionally, we parallelize variants of multikey quicksort and radix sort that are also useful in certain situations. As base-case sorter for LCP-aware string sorting we describe sequential LCP-insertion sort which calculates the LCP array and accelerates its insertions using it. Comprehensive experiments on five current multi-core platforms are then reported and discussed. The experiments show that our parallel string sorting implementations scale very well on real-world inputs and modern machines.

Keywords

Parallel string sorting String sorting Sample sort Merge sort LCP-merge sort LCP-insertion sort Super scalar string sample sort 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Karlsruhe Institute of TechnologyKarlsruheGermany

Personalised recommendations