Engineering Parallel String Sorting

@article{Bingmann2015EngineeringPS,
  title={Engineering Parallel String Sorting},
  author={T. Bingmann and A. Eberle and P. Sanders},
  journal={Algorithmica},
  year={2015},
  volume={77},
  pages={235-286}
}
  • T. Bingmann, A. Eberle, P. Sanders
  • Published 2015
  • Computer Science, Mathematics
  • Algorithmica
  • 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… CONTINUE READING
    Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
    6
    Distributed String Sorting Algorithms
    1
    Parallel Partition and Merge QuickSort (PPMQSort) on Multicore CPUs
    3
    Communication-Efficient String Sorting
    1
    Generalized enhanced suffix array construction in external memory
    19
    Practical Massively Parallel Sorting
    21
    Parallel lightweight wavelet tree, suffix array and FM-index construction
    31
    LCP-Aware Parallel String Sorting
    Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction
    3

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 54 REFERENCES
    Parallel String Sample Sort
    13
    Cache-efficient string sorting using copying
    49
    Super Scalar Sample Sort
    71
    Cache-conscious sorting of large sets of strings with dynamic tries
    65
    Merging String Sequences by Longest Common Prefixes
    11
    A simple, fast parallel implementation of Quicksort and its performance evaluation on SUN Enterprise 10000
    73
    Engineering burstsort: Toward fast in-place string sorting
    10
    A comparison of sorting algorithms for the connection machine CM-2
    357
    Optimal Parallel Merging and Sorting Without Memory Conflicts
    81
    Cache Efficient Radix Sort for String Sorting
    9