A parallel algorithm for computing shortest paths in large-scale networks

Authors:
Guozhen Tan;Xiaohui Ping
Affiliations:
Department of Computer Science, Dalian University of Technology, Dalian, P.R.China;Department of Computer Science, Dalian University of Technology, Dalian, P.R.China
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Year:
2005

Citing 2
Cited 0

Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
Network-tree model and shortest path algorithm

ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the Optimality Theorem in distributed parallel environment. Based on this theorem, a parallel algorithm using network-tree model is presented to compute shortest paths in large-scale networks. The correctness of this algorithm is proved theoretically and a series of computational test problems are performed on PC cluster. Factors such as network size and level of the network, which take effect on the performance, are discussed in detail. Results of the experiments show that the proposed parallel algorithm is efficient in computing shortest paths in large-scale networks, especially when the network size is great.