Implementation level

Difference between revisions of "Kruskal's, C++, MPI, Parallel Boost Graph Library"

From Algowiki
Jump to navigation Jump to search
[unchecked revision][checked revision]
(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...")
 
 
Line 7: Line 7:
 
[http://www.boost.org/libs/graph_parallel/doc/html/index.html Parallel Boost Graph Library]
 
[http://www.boost.org/libs/graph_parallel/doc/html/index.html Parallel Boost Graph Library]
 
* function <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#merge-local-minimum-spanning-trees merge_local_minimum_spanning_trees]</code> implements the Kruskal's algorithm;
 
* function <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#merge-local-minimum-spanning-trees merge_local_minimum_spanning_trees]</code> implements the Kruskal's algorithm;
* functions <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#dense-boruvka-minimum-spanning-tree dense_boruvka_minimum_spanning_tree]</code>, <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#boruvka-then-merge boruvka_then_merge]</code>, <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#boruvka-mixed-merge boruvka_mixed_merge]</code> combine [[Boruwka's algorithm]] and Kruskal's algorithm.
+
* functions <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#dense-boruvka-minimum-spanning-tree dense_boruvka_minimum_spanning_tree]</code>, <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#boruvka-then-merge boruvka_then_merge]</code>, <code>[http://www.boost.org/libs/graph_parallel/doc/html/dehne_gotz_min_spanning_tree.html#boruvka-mixed-merge boruvka_mixed_merge]</code> combine [[Boruvka's algorithm]] and Kruskal's algorithm.
  
 
= Locality of data and computations =
 
= Locality of data and computations =

Latest revision as of 09:54, 6 July 2022


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

1 Links

Parallel Boost Graph Library

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