20th Annual International Conference on High Performance Computing (1996)

Trivandrum, INDIA

Dec. 19, 1996 to Dec. 22, 1996

ISBN: 0-8186-7557-8

pp: 330

S.K. Das , Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

A.K. Datta , Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

S. Pothuru , Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

ABSTRACT

This paper implements and analyzes the performance of parallel algorithms for the string-to-string correction and the longest common subsequence (LCS) problems, on the shared-memory Sequent Symmetry multiprocessor machine. The speedup of the first algorithm is 12.686 with 15 processors for a sequence of length 800, while the speedup of the LCS algorithm is 3.227 employing 8 processors for a sequence of length 128.

INDEX TERMS

parallel algorithms; string-to-string correction; longest common subsequence problems; Sequent Symmetry multiprocessor; performance; parallel algorithms

CITATION

A. Datta, S. Das and S. Pothuru, "Implementing string-to-string correction and longest common subsequence problems on the Sequent Symmetry multiprocessor,"

*20th Annual International Conference on High Performance Computing(HIPC)*, Trivandrum, INDIA, 1996, pp. 330.

doi:10.1109/HIPC.1996.565843

CITATIONS