Dijkstra, C++, MPI: Parallel Boost Graph Library, 2
Jump to navigation
Jump to search
Primary author of this description: I.V.Afanasyev.
Contents
1 Links
Parallel Boost Graph Library: function crauser_et_al_shortest_paths – implementation of Dijkstra's algorithm as proposed in the paper [1]
2 Locality of data and computations
2.1 Locality of implementation
2.1.1 Structure of memory access and a qualitative estimation of locality
2.1.2 Quantitative estimation of locality
3 Scalability of the algorithm and its implementations
3.1 Scalability of the algorithm
3.2 Scalability of of the algorithm implementation
4 Dynamic characteristics and efficiency of the algorithm implementation
5 Run results
6 References
- ↑ Crauser, A, K Mehlhorn, U Meyer, and P Sanders. “A Parallelization of Dijkstra's Shortest Path Algorithm,” Proceedings of Mathematical Foundations of Computer Science / Lecture Notes in Computer Science, 1450:722–31, Berlin, Heidelberg: Springer, 1998. doi:10.1007/BFb0055823.
