BFS, C++, MPI, Boost Graph Library

From Algowiki
Revision as of 12:04, 28 June 2022 by ASA (talk | contribs) (Created page with "Primary author of this description: I.V.Afanasyev. == Software implementation of the algorithm: C++, MPI, Boost Graph Library == The <code>[h...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

1 Software implementation of the algorithm: C++, MPI, Boost Graph Library

The breadth first search function).

1.1 Implementation peculiarities of the serial algorithm

1.2 Locality of data and computations

1.2.1 Locality of implementation

1.2.1.1 Structure of memory access and a qualitative estimation of locality
1.2.1.2 Quantitative estimation of locality

1.3 Possible methods and considerations for parallel implementation of the algorithm

1.4 Scalability of the algorithm and its implementations

1.4.1 Scalability of the algorithm

1.4.2 Scalability of of the algorithm implementation

1.5 Dynamic characteristics and efficiency of the algorithm implementation

1.6 Conclusions for different classes of computer architecture