Abstract
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics. We describe the first implementation and experimental evaluation of a scalable parallel algorithm for suffix array construction. The implementation works on distributed memory computers using MPI, Experiments with up to 128 processors show good constant factors and make it look likely that the algorithm would also scale to considerably larger systems. This makes it possible to build suffix arrays for huge inputs very quickly. Our algorithm is a parallelization of the linear time DC3 algorithm.
Cite
CITATION STYLE
Kulla, F., & Sanders, P. (2007). Scalable parallel suffix array construction. In High Performance Computing in Science and Engineering 2006 - Transactions of the High Performance Computing Center Stuttgart, HLRS 2006 (pp. 543–546). Springer Verlag. https://doi.org/10.1007/978-3-540-36183-1_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
