Issue No.04 - April (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.135564
<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>
systolic algorithms; transitive closure problem; optimal systolic algorithms; data dependency; Warshal-Floyd algorithm; pipelined parallel algorithms; RCT diagram; parallel algorithms.
D. Sarkar, "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