Title :
An Improved Distribution Algorithm for Shortest Paths Problem
Author_Institution :
Department of Electrical Engineering and Computer Science, Texas Tech University
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.
Keywords :
Distributed algorithms; VLSI layout; pipelining; shortest paths computation; systolic architecture; Computer architecture; Concurrent computing; Costs; Distributed algorithms; Distributed computing; Hardware; Pipeline processing; Read-write memory; Shortest path problem; Very large scale integration; Distributed algorithms; VLSI layout; pipelining; shortest paths computation; systolic architecture;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1984.1676503
