Conference Papers Year : 2003

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.

Domains

Distributed, Parallel, and Cluster Computing [cs.DC]

Thierry Garcia  : Connect in order to contact the contributor

https://hal.science/hal-01588524

Submitted on : Friday, September 15, 2017-5:34:11 PM

Last modification on : Tuesday, July 30, 2024-12:40:03 PM

No file

Dates and versions

hal-01588524 , version 1 (15-09-2017)

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UVSQ LI-PARAD U-PICARDIE MIS UPJV-MIS-SDMA
61 View
0 Download

Altmetric

Share

More