论文信息 - Analysis and experiments for a parallel solution to the all pairs shortest path problem

Analysis and experiments for a parallel solution to the all pairs shortest path problem

This paper proposes and analyzes a parallel implementation of the matrix product algorithm for the all pairs shortest path problem for a distributed memory MIMD model. The results of experiments conducted on a 128-processor hypercube machine show that the parallel implementation achieves the performance predicted by the analysis.<<ETX>>

Ira Pramanick | Hyder Ali

[1] Clyde P. Kruskal,et al. Parallel Algorithms for Shortest Path Problems , 1985, ICPP.

[2] Sartaj Sahni,et al. All Pairs Shortest Paths on a Hypercube Multiprocessor , 1987, ICPP.

[3] C. Savage. Parallel Algorithms for Graph Theoretic Problems , 1977 .

[4] Geoffrey C. Fox,et al. Matrix algorithms on a hypercube I: Matrix multiplication , 1987, Parallel Comput..

[5] Vipin Kumar,et al. Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem , 1991, J. Parallel Distributed Comput..

[6] Lakani. An Improved Distribution Algorithm for Shortest Paths Problem , 1984, IEEE Transactions on Computers.

[7] Sartaj Sahni,et al. Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[8] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.