An Improved Distribution Algorithm for Shortest Paths Problem

Authors:
G. D. Lakani
Affiliations:
Department of Electrical Engineering and Computer Science, Texas Tech University
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 5
Cited 0

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI

IEEE Transactions on Computers
A Distributed Algorithm for Shortest Paths

IEEE Transactions on Computers
A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System

IEEE Transactions on Software Engineering
Why Systolic Architectures?

Computer

Quantified Score

Hi-index	14.98

Visualization

Abstract

The time complexity of a distributed algorithm [5] for all-pair shortest path problem is improved by a factor 0(n) by pipelining instructions. Its implementation using VLSI technology is proposed and area complexity is computed.