Difference between revisions of "BFS, C++, MPI, Boost Graph Library"
Jump to navigation
Jump to search
[checked revision] | [checked revision] |
Line 4: | Line 4: | ||
The <code>[http://www.boost.org/libs/graph_parallel/doc/html/breadth_first_search.html breadth_first_search] function</code>. | The <code>[http://www.boost.org/libs/graph_parallel/doc/html/breadth_first_search.html breadth_first_search] function</code>. | ||
− | |||
− | |||
=== Locality of data and computations === | === Locality of data and computations === | ||
==== Locality of implementation ==== | ==== Locality of implementation ==== | ||
===== Structure of memory access and a qualitative estimation of locality ===== | ===== Structure of memory access and a qualitative estimation of locality ===== | ||
− | |||
===== Quantitative estimation of locality ===== | ===== Quantitative estimation of locality ===== | ||
− | |||
− | |||
=== Scalability of the algorithm and its implementations === | === Scalability of the algorithm and its implementations === | ||
Line 20: | Line 15: | ||
=== Dynamic characteristics and efficiency of the algorithm implementation === | === Dynamic characteristics and efficiency of the algorithm implementation === | ||
− | === | + | === Run results === |
+ | {{Buttonlinkimp|11}} | ||
[[Category:Articles in progress]] | [[Category:Articles in progress]] | ||
[[Ru:C++, MPI, Boost Graph Library]] | [[Ru:C++, MPI, Boost Graph Library]] |
Revision as of 16:03, 28 June 2022
Primary author of this description: I.V.Afanasyev.
Contents
1 Software implementation of the algorithm: C++, MPI, Boost Graph Library
The breadth_first_search function
.