A Modular Systolic Linearization of the Warshall-Floyd Algorithm

Authors:
Jean Frédéric Myoupo;Anne Cécile Fabret
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1996

Citing 14
Cited 3

Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

IEEE Transactions on Computers
A derivation of a distributed implementation of Warshall's algorithm

Science of Computer Programming
Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays

IEEE Transactions on Computers
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems

IEEE Transactions on Computers
Synthesizing Linear Array Algorithms from Nested FOR Loop Algorithms

IEEE Transactions on Computers
Linear systolic arrays for matrix computations

Journal of Parallel and Distributed Computing
On Mapping Algorithms to Linear and Fault-Tolerant Systolic Arrays

IEEE Transactions on Computers
On high-speed computing with a programmable linear array

The Journal of Supercomputing
Linear systolic arrays for matrix multiplication: comparisons of existing synthesis methods and new results

Proceedings of the international workshop on Algorithms and parallel VLSI architectures II
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
A modification of Warshall's algorithm for the transitive closure of binary relations

Communications of the ACM
On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays

IEEE Transactions on Parallel and Distributed Systems
Synchronizing large VLSI processor arrays

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Computational Aspects of VLSI

Computational Aspects of VLSI

The Algebraic Path Problem Revisited

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

Journal of Parallel and 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	0.00

Visualization

Abstract

In this paper, we use a variant of the geometric method to derive efficient modular linear systolic algorithms for the transitive closure and shortest path problems. Furthermore, we show that partially-pipelined modular linear systolic algorithms with an output operation, for matrix multiplication, can be as fast as the fully-pipelined existing ones and, moreover, they need less cells.