论文信息 - A Practical Parallel Algorithm for All-Pair Shortest Path Based on Pipelining

A Practical Parallel Algorithm for All-Pair Shortest Path Based on Pipelining

On the basis of Floyd algorithm with the extended path matrix, a parallel algorithm which resolves all-pair shortest path (APSP) problem on cluster environment is analyzed and designed. Meanwhile, the parallel APSP pipelining algorithm makes full use of overlapping technique between computation and communication. Compared with broadcast operation, the parallel algorithm reduces communication cost. This algorithm has been implemented on MPI on PC-cluster. The theoretical analysis and experimental results show that the parallel algorithm is an efficient and scalable algorithm.

[1] Jun Zhi-cai. Study and Implement of Shortest Path Parallel Algorithms with Two Strategies , 2006 .

[2] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[3] Yijie Han,et al. Improved algorithm for all pairs shortest paths , 2004, Inf. Process. Lett..

[4] Tian Ling. Practical parallel algorithm for all-pairs shortest-path problem , 2005 .

[5] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

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

[7] Timothy M. Chan. All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time , 2005, WADS.

[8] Tadao Takaoka. An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem , 2005, Inf. Process. Lett..

[9] Uri Zwick,et al. A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths , 2004, ISAAC.

[10] Seth Pettie,et al. A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs , 2002, ICALP.

[11] George Karypis,et al. Introduction to Parallel Computing Solution Manual , 2003 .

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

[13] Yijie Han. A note of an O(n3/logn) time algorithm for all pairs shortest paths , 2008, Inf. Process. Lett..