The Community for Technology Leaders
Green Image
ABSTRACT
<p>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.</p>
INDEX TERMS
systolic algorithms; transitive closure problem; optimal systolic algorithms; data dependency; Warshal-Floyd algorithm; pipelined parallel algorithms; RCT diagram; parallel algorithms.
CITATION
A. Mukherjee, D. Sarkar, "Design of Optimal Systolic Algorithms for the Transitive Closure Problem", IEEE Transactions on Computers, vol. 41, no. , pp. 508-512, April 1992, doi:10.1109/12.135564
99 ms
(Ver 3.3 (11022016))