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

Thierry Garcia (1) , Jean-Frédéric Myoupo (2) , David Semé (3)

1 LI-PaRAD - Laboratoire d'Informatique Parallélisme Réseaux Algorithmes Distribués
2 MIS - Modélisation, Information et Systèmes - UR UPJV 4290
3 LaRIA - Laboratoire de Recherche en Informatique d'Amiens

The paper presents a coarse-grained multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with P processors in O(N/sup 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.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Thierry Garcia, Jean-Frédéric Myoupo, David Semé. A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003., Mar 2003, Gênes, Italy. pp.349--356, ⟨10.1109/EMPDP.2003.1183610⟩. ⟨hal-01588524⟩