This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design of Optimal Systolic Algorithms for the Transitive Closure Problem
April 1992 (vol. 41 no. 4)
pp. 508-512

New optimal systolic algorithms for the transitive closure problem on ring and linear arrays of processors is presented. The data dependency of the Warshal-Floyd algorithm is exploited to obtain highly pipelined parallel algorithms. One of the algorithms is asymptotically seven times more cost-effective than previous algorithms for computing transitive closure problems. The authors introduce a new expository device, called the RCT diagram, that depicts simultaneously the flow of data and computation of parallel algorithms.

[1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[2] R. Floyd, "Shortest path,"CACM, vol. 5, no. 6, 1962.
[3] V. K. P. Kumar and Y. C. Tsai, "Mapping two dimensional systolic arrays to one dimensional arrays and applications," inProc. Int. Conf. Parallel Processing, 1984.
[4] S.Y. Kung,VLSI Array Processors, Prentice Hall, Englewood Cliffs, N.J. 1988.
[5] S. Y. Kung, S. C. Lo, and P. S. Lewis, "Optimal systolic design for the transitive closure problem,"IEEE Trans. Comput., vol. C-36, no. 5, pp. 603-614, May 1987.
[6] P. S. Lewis and S. Y. Kung, "Dependence graph based design of systolic arrays for the algebraic path problem," inProc. 1986 Asilomar Conf. Signals, Syst., Comput., 1986.
[7] A. Mukhopadhyay, "Hardware algorithms for nonumeric computation,"IEEE Trans. Comput., vol. C-28, 1979.
[8] G. Rote, "A systolic array algorithm for the algebraic path problems (shortest paths, matrix inversion),"Computing, vol. 34, 1985.
[9] D. Sarkar, "LESSA: An array to solve a set of linear equations,"Int. J. Comput. Math., vol. 21, 1987.
[10] D. Sarkar and A. Mukherjee, "Design of optimal linear arrays for the transitive closure problem," TR-01-90, Dep. Math. and Comput. Sci., Univ. of Miami, Coral Gables, FL 33124.
[11] P. J. Varman and I. V. Ramakrishnan, "Dynamic programming and transitive closure on linear pipelines," inProc. Int. Conf. Parallel Processing, 1984.
[12] S. Warshal, "A theorem on Boolean matrices,"J. ACM, vol. 9, 1962.

Index Terms:
systolic algorithms; transitive closure problem; optimal systolic algorithms; data dependency; Warshal-Floyd algorithm; pipelined parallel algorithms; RCT diagram; parallel algorithms.
Citation:
D. Sarkar, A. Mukherjee, "Design of Optimal Systolic Algorithms for the Transitive Closure Problem," IEEE Transactions on Computers, vol. 41, no. 4, pp. 508-512, April 1992, doi:10.1109/12.135564
Usage of this product signifies your acceptance of the Terms of Use.