Parallel Suffix Array Construction by Accelerated Sampling
Distributed, Parallel, and Cluster Computing
2013-02-26 v1 Data Structures and Algorithms
Abstract
A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique which we call accelerated sampling. It runs in optimal O(n/p) local computation and communication, and requires a near optimal O(log log p) synchronisation steps. The algorithm provides an improvement over the synchronisation costs of existing algorithms, and reinforces the importance of the sampling technique.
Cite
@article{arxiv.1302.5851,
title = {Parallel Suffix Array Construction by Accelerated Sampling},
author = {Matthew Felice Pace and Alexander Tiskin},
journal= {arXiv preprint arXiv:1302.5851},
year = {2013}
}
Comments
12 pages