Parallel Dijkstra's Algorithm Based on Multi-Core and MPI

Article Preview

Abstract:

Dijkstra’s algorithm is a typical but low efficiency shortest path algorithm. The parallel Dijkstra’s algorithm based on message passing interface (MPI) is efficient and easy to implement, but it’s not very suitable for PC platform. This paper describes a parallel Dijkstra’s algorithm. We designed the parallel algorithm and realized it based on multi-core PC and MPI software platform. The implementation is convenient, and the performance experiment shows that the algorithm has satisfied speedup and efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

750-753

Citation:

Online since:

December 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Thomas J. Misa:J. Communications of the ACM. Vol. 53 (2010), p.41.

Google Scholar

[2] A.R. Soltani, H. Tawfik, J.Y. Goulermas, T. Fernando:J. Advanced Engineering Informatics. Vol. 16 (2002), p.291.

Google Scholar

[3] Jeffrey L. Solka, James C. Perrya, Brian R. Poellingerb:J. Neurocomputing. Vol. 8 (1995), p.195.

Google Scholar

[4] A. Crauser, K. Mehlhorn, U. Meyer, P. Sanders:J. Mathematical Foundations of Computer Science. Vol. 1450 (1998), p.722.

Google Scholar

[5] Guoliang Chen, Hong An: Applocation of Parallel Computing. (Higher Education Press, China, 2004). In Chinese.

Google Scholar