Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01588524
Contributor : Thierry Garcia Connect in order to contact the contributor
Submitted on : Friday, September 15, 2017 - 5:34:11 PM
Last modification on : Friday, October 22, 2021 - 4:41:33 AM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

146