Fast parallel algorithms for the longest common subsequence problem using an optical bus

Authors:
Xiaohua Xu;Ling Chen;Yi Pan;Ping He
Affiliations:
Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, P.R.China;Department of Computer Science, Yangzhou University, Yangzhou, P.R.China;Department of Computer Science, Georgia State University, Atlanta, GA;Department of Computer Science, Yangzhou University, Yangzhou, P.R.China
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

Citing 12
Cited 3

Parallel parsing on a one-way array of finite-state machines

IEEE Transactions on Computers
Efficient parallel algorithms for string editing and related problems

SIAM Journal on Computing
Systolic-based parallel architecture for the longest common subsequences problem

Integration, the VLSI Journal
Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM (JACM)
Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems

The Journal of Supercomputing
Solving graph theory problems using reconfigurable pipelined optical buses

Parallel Computing
Parallel Computing Using Optical Interconnections

Parallel Computing Using Optical Interconnections
Parallel Algorithms for the Longest Common Subsequence Problem

HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism

Information Processing Letters
Scalable and Efficient Parallel Algorithms for Euclidean Distance Transform on the LARPBS Model

IEEE Transactions on Parallel and Distributed Systems
Notes on searching in multidimensional monotone arrays

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal

Repetitions detection on a linear array with reconfigurable pipelined bus system

International Journal of Parallel, Emergent and Distributed Systems
Distributed Code and Data Propagation Algorithm for Longest Common Subsequence Problem Solving

KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel algorithm for the longest common subsequence problem on LARPBS is presented. For two sequences of lengths m and n, the algorithm uses p processors and costs O(mn/p) computation time where 1 ≤ p ≤ max{m, n}. Time-area cost of the algorithm is O(mn/p) and memory space required is O((m+n)/p) which all reach optimal. We also show this algorithm is scalable when the number of processors p satisfies 1 ≤ p ≤ max{m, n}. To the best of our knowledge this is the fastest and cost-optimal parallel algorithm for LCS problem on array architectures.