loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem
Genova, Italy
February 05-February 07
ISBN: 0-7695-1875-3
ASCII Text
x 
 
Thierry Garcia, Jean-Frédéric Myoupo, David Semé, "A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 349, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003.
 
 
BibTex
x
 
@article{ 10.1109/EMPDP.2003.1183610,
author = {Thierry Garcia and Jean-Frédéric Myoupo and David Semé},
title = {A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem},
journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on},
volume = {0},
year = {2003},
issn = {1066-6192},
pages = {349},
doi = {http://doi.ieeecomputersociety.org/10.1109/EMPDP.2003.1183610},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
TI - A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem
SN - 1066-6192
SP
EP
A1 - Thierry Garcia,
A1 - Jean-Frédéric Myoupo,
A1 - David Semé,
PY - 2003
KW - null
VL - 0
JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
ER -
 
Thierry Garcia, Universit? de Picardie Jules Verne
Jean-Frédéric Myoupo, Universit? de Picardie Jules Verne
David Semé, Universit? de Picardie Jules Verne
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(N2\over 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.
Citation:
Thierry Garcia, Jean-Frédéric Myoupo, David Semé, "A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem," pdp, pp.349, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003
Usage of this product signifies your acceptance of the Terms of Use.