Lightweight Distributed Suffix Array Construction
Abstract
We present two new distributed suffix array construction algorithms. One of our algorithms requires only half as much memory as its competitor (PSAC) [Flick & Aluru, SC 2015], while achieving similar speed. In practice, we can compute on the same hardware suffix arrays for text twice as large as PSAC. The other algorithm still requires less memory than PSAC but is faster on some instances. As a by-product, we also engineered the first distributed string sorting algorithm. All of our algorithms are tested on text collections of up to 115 GB and running on 1280 cores.
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)
Pages: 27 - 38
Editors: Stephen Kobourov, University of Arizona, USA and Henning Meyerhenke, Humboldt-Universität zu Berlin, Germany
ISBN (Online): 978-1-61197-549-9
Copyright
© 2019 by the Society for Industrial and Applied Mathematics.
History
Published online: 2 January 2019
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
There are no citations for this item