An Optimal Systolic Array for the Algebraic Path Problem

Authors:
Paul S. Lewis;Sun-Yuan Kung
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 4
Cited 4

Graphs and algorithms

Graphs and algorithms
VLSI array processors

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

IEEE Transactions on Computers
An orthogonal systolic array for the algebraic path problem

Computing

A Family of Efficient Regular Arrays for Algebraic Path Problem

IEEE Transactions on Computers
Design of Space-Optimal Regular Arrays for Algorithms with Linear Schedules

IEEE Transactions on Computers
Computing transitive closure on systolic arrays of fixed size

Distributed Computing
Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform

The Journal of Supercomputing

Quantified Score

Hi-index	14.99

Visualization

Abstract

A systolic array design for the algebraic path problem (APP) is presented that is both simpler and more efficient than previously proposed configurations. This array uses N/sup 2/ orthogonally connected processing elements and requires 2N I/O connections. Total computation time is 5N-2, which is the minimum time possible in a systolic implementation. The data pipelining rate is one, so no pipeline interleave is required. For multiple problem instances a block pipeline rate of N can be achieved, which is optimal for an array of N/sup 2/ processing elements.