Scalable detection of MPI-2 remote memory access inefficiency patterns

Abstract

Wait states in parallel applications can be identified by scanning event traces for characteristic patterns. In our earlier work we defined such inefficiency patterns for MPI-2 one-sided communication, although still based on a serial traceanalysis scheme with limited scalability. In this article we show how wait states in one-sided communications can be detected in a more scalable fashion by taking advantage of a new scalable trace-analysis approach based on a parallel replay, which was originally developed for MPI-1 point-to-point and collective communication. Moreover, we demonstrate the scalability of our method and its usefulness for the optimization cycle with applications running on up to 32,768 cores.

Trace-Driven Memory Access Pattern Recognition in Computational Kernels

“…Recent efforts have demonstrated how pre-defined, inefficient, access patterns can be detected in parallel applications [9]. Other efforts include visualization of memory traces [2], which aim to convey important information the users in a graphical way.…”