The Shortest Path Parallel Algorithm on Single Source Weighted Multi-level Graph

Aiming at the single source shortest path problem on the single source weighted multi-level graph, this paper brings forward a new and practical parallel algorithm on 2-D mesh network by constructing a model of vector-matrix multiple and choosing the planar evenly partition method. The parallel algo...

Full description

Saved in:
Bibliographic Details
Published in2009 Second International Workshop on Computer Science and Engineering Vol. 2; pp. 308 - 311
Main Authors Qiang Peng, Yulian Yu, Wenhong Wei
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2009
Subjects
Algorithm design and analysis
Computer science
Concurrent computing
Graph theory
Intelligent transportation systems
Mesh networks
parallel algorithm
Parallel algorithms
Partitioning algorithms
Performance analysis
Shortest path problem
single source shortest path
single source weighted multi-level graph
vector-matrix multiple
Online AccessGet full text

Cover

More Information
Summary:Aiming at the single source shortest path problem on the single source weighted multi-level graph, this paper brings forward a new and practical parallel algorithm on 2-D mesh network by constructing a model of vector-matrix multiple and choosing the planar evenly partition method. The parallel algorithm is propitious to handle different sizes of multi-level graph structure by the use of its simple and regular characteristic, and our algorithm only needs less computation resources. The parallel algorithm was implemented on MPI. The theoretical analysis and the experimental results prove that the parallel algorithm has the good performances in terms of speed-up ratio and parallel efficiency, and its performance is a little better than the parallel dijkstra algorithm.
ISBN:9781424452859
9780769538815
0769538819
1424452856
DOI:10.1109/WCSE.2009.819