New Systolic Arrays for the Longest Common Subsequence Problem

Abstract New systolic arrays are presented to solve the longest common subsequence (LCS) problem. The first array is based on a previous work to compute the length of an LCS. The second array improves on the first one. The second array is about 1 4 faster than the first array, and each processing element (PE) of the second array requires one less port for both input and output to transfer one less value. Either of the two arrays can be equipped with a content-addressable memory in each PE to recover an LCS. The resulting array requires fewer steps than the previously proposed one.

[1]  Thomas D. Clark,et al.  Corporate systems management: an overview and research perspective , 1992, CACM.

[2]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[3]  Richard C. T. Lee,et al.  Systolic algorithms for the longest common subsequence problem , 1987 .

[4]  Yves Robert,et al.  Systolic algorithms & architectures , 1991 .

[5]  Yves Robert,et al.  A Systolic Array for the Longest Common Subsequence Problem , 1985, Inf. Process. Lett..

[6]  Ferng-Ching Lin,et al.  Pin reduction through variable duplications and substitutions in a data dependence graph , 1989, Parallel Comput..

[7]  M. W. Du,et al.  New Algorithms for the LCS Problem , 1984, J. Comput. Syst. Sci..

[8]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[9]  Alberto Apostolico.  Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings , 1986, Inf. Process. Lett..

[10]  Paul M. B. Vitányi.  Locality, Communication, and Interconnect Length in Multicomputers , 1988, SIAM J. Comput..

[11]  Ehud Shapiro,et al.  Spatial machines: a more realistic approach to parallel computation , 1992, CACM.

[12]  Omar Wing.  A content-addressable systolic array for sparse matrix computation , 1985, J. Parallel Distributed Comput..

[13]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[14]  H. T. Kung.  Why systolic architectures? , 1982, Computer.