A Family of Efficient Regular Arrays for Algebraic Path Problem

Authors:
Pen-Yuang Chang;Jong-Chuang Tsay
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1994

Citing 7
Cited 3

Graphs and algorithms

Graphs and algorithms
Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

IEEE Transactions on Computers
Regular interactive algorithms and their implementations on processor arrays

Regular interactive algorithms and their implementations on processor arrays
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems

IEEE Transactions on Computers
An Optimal Systolic Array for the Algebraic Path Problem

IEEE Transactions on Computers
An improved systolic algorithm for the algebraic path problem

Integration, the VLSI Journal - Special issue on algorithms and architectures
Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure

IEEE Transactions on Parallel and Distributed Systems

Design of Space-Optimal Regular Arrays for Algorithms with Linear Schedules

IEEE Transactions on Computers
The Algebraic Path Problem Revisited

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
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.98

Visualization

Abstract

The method of decomposing a dependence graph into multiple phases with an appropriate m-phase schedule function is useful for designing faster regular arrays for matrix multiplication and transitive closure. In this paper, we further apply this method to design several parallel algorithms for the algebraic path problem and derive N/spl times/N 2D regular arrays with execution times [9N/2]-2 (for the cylindrical array and the orthogonal one) and 4N-2 (for the spherical one).