Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools

@article{Bingmann2018ScalableSA,
  title={Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools},
  author={T. Bingmann},
  journal={ArXiv},
  year={2018},
  volume={abs/1808.00963}
}
  • T. Bingmann
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • This dissertation focuses on two fundamental sorting problems: string sorting and suffix sorting. The first part considers parallel string sorting on shared-memory multi-core machines, the second part external memory suffix sorting using the induced sorting principle, and the third part distributed external memory suffix sorting with a new distributed algorithmic big data framework named Thrill. Sorting strings or vectors is a basic algorithmic challenge different from integer sorting because… CONTINUE READING
    7 Citations

    Figures, Tables, and Topics from this paper.

    Distributed String Sorting Algorithms
    • 1
    • Highly Influenced
    Engineering Faster Sorters for Small Sets of Items
    • 2
    • PDF
    Communication-Efficient String Sorting
    • 1
    • PDF
    Engineering In-place (Shared-memory) Sorting Algorithms
    Scalable Construction of Text Indexes with Thrill
    • 1
    • PDF
    SACABench: Benchmarking Suffix Array Construction
    • 2
    High-Quality Hypergraph Partitioning
    • 6
    • PDF

    References

    SHOWING 1-10 OF 319 REFERENCES
    Engineering Parallel String Sorting
    • 20
    • PDF
    Simple Linear Work Suffix Array Construction
    • 465
    • PDF
    Cache-efficient string sorting using copying
    • 49
    • PDF
    An efficient, versatile approach to suffix sorting
    • 28
    • PDF
    Two Efficient Algorithms for Linear Time Suffix Array Construction
    • 123
    • PDF
    Parallel suffix sorting
    • 28
    Parallel Construction of Suffix Trees and the All-Nearest-Smaller-Values Problem
    • Patrick Flick, S. Aluru
    • Computer Science
    • 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
    • 2017
    • 4
    Space Efficient Linear Time Construction of Suffix Arrays
    • 206
    • PDF
    Parallel distributed memory construction of suffix and longest common prefix arrays
    • Patrick Flick, S. Aluru
    • Computer Science
    • SC15: International Conference for High Performance Computing, Networking, Storage and Analysis
    • 2015
    • 27
    • PDF