Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
Data Structures and Algorithms
2018-08-06 v1 Distributed, Parallel, and Cluster Computing
Abstract
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.
Cite
@article{arxiv.1808.00963,
title = {Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools},
author = {Timo Bingmann},
journal= {arXiv preprint arXiv:1808.00963},
year = {2018}
}
Comments
396 pages, dissertation, Karlsruher Instituts f\"ur Technologie (2018). arXiv admin note: text overlap with arXiv:1101.3448 by other authors