A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem

The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in O(ƾ È ) in time and O(È) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very efficient.

• Type: Conference
• Year: 2003
• Where: PDP
• Authors: Thierry Garcia, Jean Frédéric Myoupo, David Semé
• Keywords: CGM Algorithm, Coarse-Grained Multicomputer Algorithm, Distributed And Parallel Computing, PDP 2003, first Cgm Algorithm