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
Joao Paulo Kitajima , Campinas State University
Gonzalo Navarro , University of Chile
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.
Suffix Array, Parallel Algorithm, Sorting

G. Navarro and J. P. Kitajima, "A Fast Distributed Suffix Array Generation Algorithm," String Processing and Information Retrieval, International Symposium on(SPIRE), Cancun, Mexico, 1999, pp. 97.
86 ms
(Ver 3.3 (11022016))