Title :
Implementing string-to-string correction and longest common subsequence problems on the Sequent Symmetry multiprocessor
Author :
Das, Sajal K. ; Datta, Ajoy K. ; Pothuru, Surendra
Author_Institution :
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
Keywords :
multiprocessing systems; parallel algorithms; performance evaluation; Sequent Symmetry multiprocessor; longest common subsequence problems; parallel algorithms; performance; string-to-string correction; Algorithm design and analysis; Computer science; Concurrent computing; DNA; Parallel algorithms; Parallel programming; Performance analysis; Phase change random access memory; Sequences; Signal processing algorithms;
Conference_Titel :
High Performance Computing, 1996. Proceedings. 3rd International Conference on
Conference_Location :
Trivandrum
Print_ISBN :
0-8186-7557-8
DOI :
10.1109/HIPC.1996.565843
