Design of Optimal Systolic Algorithms for the Transitive Closure Problem

Authors:
Dilip Sarkar;Amar Mukherjee
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 5
Cited 1

VLSI array processors

VLSI array processors
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems

IEEE Transactions on Computers
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Parallel FPGA-based all-pairs shortest-paths in a directed graph

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.