Fast parallel algorithm for all-pairs shortest path problem and its VLSI implementation
作者:
S.Dey,
P.K.Srimani,
期刊:
IEE Proceedings E (Computers and Digital Techniques)
(IET Available online 1989)
卷期:
Volume 136,
issue 2
页码: 85-89
年代: 1989
DOI:10.1049/ip-e.1989.0012
出版商: IEE
数据来源: IET
摘要:
We present a new parallel algorithm to solve the all-pairs shortest path problem in a given graph which is considerably faster than the most recently published algorithm [7] for the same problem. Next we propose a suitable VLSI systolic architecture to map our algorithm and evaluate the performance of the proposed architecture in terms of execution time and inter-processor communication time. We show that our implementation has O(log2n) execution time (compare-exchange time) and O(nlogn) communication time compared to O(nlogn) and O(n2) in [7].
点击下载:
PDF
(684KB)
返 回