Fast and Lightweight Distributed Suffix Array Construction -- First Results
Data Structures and Algorithms
2024-12-16 v1
Abstract
We present first algorithmic ideas for a practical and lightweight adaption of the DCX suffix array construction algorithm [Sanders et al., 2003] to the distributed-memory setting. Our approach relies on a bucketing technique which enables a lightweight implementation which uses less than half of the memory required by the currently fastest distributed-memory suffix array algorithm PSAC [Flick and Aluru, 2015] while being competitive or even faster in terms of running time.
Cite
@article{arxiv.2412.10160,
title = {Fast and Lightweight Distributed Suffix Array Construction -- First Results},
author = {Manuel Haag and Florian Kurpicz and Peter Sanders and Matthias Schimek},
journal= {arXiv preprint arXiv:2412.10160},
year = {2024}
}