Implementing string-to-string correction and longest common subsequence problems on the Sequent Symmetry multiprocessor

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.