
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Sarkar, A. Mukherjee, "Design of Optimal Systolic Algorithms for the Transitive Closure Problem," IEEE Transactions on Computers, vol. 41, no. 4, pp. 508512, April, 1992.  
BibTex  x  
@article{ 10.1109/12.135564, author = {D. Sarkar and A. Mukherjee}, title = {Design of Optimal Systolic Algorithms for the Transitive Closure Problem}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {4}, issn = {00189340}, year = {1992}, pages = {508512}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.135564}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Design of Optimal Systolic Algorithms for the Transitive Closure Problem IS  4 SN  00189340 SP508 EP512 EPD  508512 A1  D. Sarkar, A1  A. Mukherjee, PY  1992 KW  systolic algorithms; transitive closure problem; optimal systolic algorithms; data dependency; WarshalFloyd algorithm; pipelined parallel algorithms; RCT diagram; parallel algorithms. VL  41 JA  IEEE Transactions on Computers ER   
New optimal systolic algorithms for the transitive closure problem on ring and linear arrays of processors is presented. The data dependency of the WarshalFloyd algorithm is exploited to obtain highly pipelined parallel algorithms. One of the algorithms is asymptotically seven times more costeffective 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: AddisonWesley, 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. C36, no. 5, pp. 603614, 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. C28, 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," TR0190, 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.