Root Causing MPI Workloads Imbalance Issues via Scalable MPI Critical Path Analysis

Shatalin, Artem; Slobodskoy, Vitaly; Fatin, Maksim

doi:10.1007/978-3-031-22941-1_37

Cited by 1 publication

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a recent paper [25], the authors propose a highly scalable MPI call replay-based solution for constructing the critical path with less than 5% of the collection overhead and less than 5% of the application's elapsed time spent on post-processing independently on the number of ranks. The approach has been tested on various real-world workloads and stays within performance targets even on a relatively high scale.…”

Section: Related Workmentioning

confidence: 99%

Finding Bottlenecks in Message Passing Interface Programs by Scalable Critical Path Analysis

Korkhov,

Gankevich,

Gavrikov

et al. 2023

Algorithms

View full text Add to dashboard Cite

Bottlenecks and imbalance in parallel programs can significantly affect performance of parallel execution. Finding these bottlenecks is a key issue in performance analysis of MPI programs especially on a large scale. One of the ways to discover bottlenecks is to analyze the critical path of the parallel program: the longest execution path in the program activity graph. There are a number of methods of finding the critical path; however, most of them suffer a performance drop when scaled. In this paper, we analyze several methods of critical path finding based on classical Dijkstra and Delta-stepping algorithms along with the proposed algorithm based on topological sorting. Corresponding algorithms for each approach are presented including additional enhancements for increasing performance. The implementation of the algorithms and resulting performance for several benchmark applications (NAS Parallel Benchmarks, CP2K, OpenFOAM, LAMMPS, and MiniFE) are analyzed and discussed.

show abstract

Section: Related Workmentioning

confidence: 99%