论文信息 - Computing Transitive Closure Problem on Linear Systolic Array

Computing Transitive Closure Problem on Linear Systolic Array

We consider the problem of computing transitive closure of a given directed graph on the regular bidirectional systolic array. The designed array has n PEs, where n is a number of nodes in the graph. This is an optimal number for a given problem size.

Emina I. Milovanovic | Igor Z. Milovanovic | B. M. Randjelovic

[1] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[2] H. T. Kung. Why systolic architectures? , 1982, Computer.

[3] W. Shang,et al. On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays , 1992, IEEE Trans. Parallel Distributed Syst..

[4] Ali R. Hurson,et al. General-purpose systolic arrays , 1993, Computer.

[5] Mile K. Stojcev,et al. Hexagonal systolic arrays for matrix multiplication , 2001 .

[6] Sun-Yuan Kung,et al. Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems , 1987, IEEE Transactions on Computers.

[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .