The Community for Technology Leaders
String Processing and Information Retrieval, International Symposium on (1999)
Cancun, Mexico
Sept. 21, 1999 to Sept. 24, 1999
ISBN: 0-7695-0268-7
pp: 97
Gonzalo Navarro , University of Chile
Joao Paulo Kitajima , Campinas State University
ABSTRACT
We present a distributed algorithm for suffix array generation, based on the sequential algorithm of Manber and Myers. The sequential algorithm is O(n log n) in the worst case and O(n log log n) on average, where n is the text size. Using p processors connected through a high bandwidth network, we obtain O((n/p) log log n) average time, which is an almost optimal speedup. Unlike previous algorithms, the text is not transmitted through the network and hence the messages exchanged are much smaller. We present some experimental evidence to show that the new algorithm can be faster than the sequential Manber & Myers counterpart.
INDEX TERMS
Suffix Array, Parallel Algorithm, Sorting
CITATION
Gonzalo Navarro, Joao Paulo Kitajima, "A Fast Distributed Suffix Array Generation Algorithm", String Processing and Information Retrieval, International Symposium on, vol. 00, no. , pp. 97, 1999, doi:10.1109/SPIRE.1999.796583
90 ms
(Ver 3.3 (11022016))