A Coarse-Grained Multicomputer algorithm for the detection of repetitions
The paper presents a Coarse-Grained Multicomputer algorithm that solves the problem of detection of repetitions. This algorithm can be implemented in the CGM model with P processors in O(N-2/p) in time and O(P) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very efficient. (C) 2004 Elsevier B.V. All rights reserved.
coarse-grained multicomputers parallel algorithms dynamic programming string matching