Summary: We present two new distributed suffix array construction algorithms. One of our algorithms requires only half as much memory as its competitor (PSAC) [P. Flick and S. Aluru, “Parallel distributed memory construction of suffix and longest common prefix arrays”, in: Proceedings of the international conference for high performance computing, networking, storage and analysis, SC 2015. New York, NY: Association for Computing Machinery (ACM). Paper No. 16, 10 p. (2015; doi:10.1145/2807591.2807609)], 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.
For the entire collection see [Zbl 1409.68020].