guest ::
| Home > Publications database > Trace-Based Detection of Lock Contention in MPI One-Sided Communication |
| Home > Publications database > Trace-Based Detection of Lock Contention in MPI One-Sided Communication |
| Contribution to a conference proceedings/Contribution to a book | FZJ-2017-03736 |
; ; ;
2017
Springer International Publishing
Cham
This record in other databases:
Please use a persistent id in citations: doi:10.1007/978-3-319-56702-0_6
Abstract: Performance analysis is an essential part of the development process of HPC applications. Thus, developers need adequate tools to evaluate design and implementation decisions to effectively develop efficient parallel applications. Therefore, it is crucial that tools provide an as complete support as possible for the available language and library features to ensure that design decisions are not negatively influenced by the level of available tool support. The message passing interface (MPI) supports three basic communication paradigms: point-to-point, collective, and one-sided. Each of these targets and excels at a specific application scenario. While current performance tools support the first two quite well, one-sided communication is often neglected. In our earlier work, we were able to reduce this gap by showing how wait states in MPI one-sided communication using active-target synchronization can be detected at large scale using our trace-based message replay technique. Further extending our work on the detection of progress-related wait states in ARMCI, this paper presents an improved infrastructure that is capable of not only detecting progress-related wait states, but also wait states due to lock contention in MPI passive-target synchronization. We present an event-based definition of lock contention, the trace-based algorithm to detect it, as well as initial results with a micro-benchmark and an application kernel scaling up to 65,536 processes.
|
The record appears in these collections: |