Implementation level

Dijkstra, C++, MPI: Parallel Boost Graph Library, 1

From Algowiki
Revision as of 10:36, 4 July 2022 by ASA (talk | contribs) (Created page with "{{level-i}} Primary author of this description: I.V.Afanasyev. = Links = [http://www.boost.org/libs/graph_parallel/doc/html/index.html Paral...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Primary author of this description: I.V.Afanasyev.

1 Links

Parallel Boost Graph Library: function eager_dijkstra_shortest_paths – direct implementation of Dijkstra's algorithm.

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

Get perf. data

Retrieved from "https://algowiki-project.org/algowiki/en/index.php?title=Dijkstra,_C%2B%2B,_MPI:_Parallel_Boost_Graph_Library,_1&oldid=10254"