Computing transitive closure problem on linear systolic array

Authors:
I. Ž. Milovanović;E. I. Milovanović;B. M. Randjelović
Affiliations:
Faculty of Electronic Engineering, Niš, Serbia;Faculty of Electronic Engineering, Niš, Serbia;Faculty of Electronic Engineering, Niš, Serbia
Venue:
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
Year:
2004

Citing 7
Cited 1

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)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
General-Purpose Systolic Arrays

Computer
On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays

IEEE Transactions on Parallel and Distributed Systems
Hexagonal systolic arrays for matrix multiplication

Highly parallel computaions
Why Systolic Architectures?

Computer

Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.