Using MPI Communication Patterns to Guide Source Code Transformations

Authors:
Robert Preissl;Martin Schulz;Dieter Kranzlmüller;Bronis R. Supinski;Daniel J. Quinlan
Affiliations:
CASC, Lawrence Livermore National Laboratory, USA and GUP, Johannes Kepler University Linz, Austria/Europe;CASC, Lawrence Livermore National Laboratory, USA;GUP, Johannes Kepler University Linz, Austria/Europe;CASC, Lawrence Livermore National Laboratory, USA;CASC, Lawrence Livermore National Laboratory, USA
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part III
Year:
2008

Citing 4
Cited 6

Interprocedural slicing using dependence graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Event graph visualization for debugging large applications

SPDT '96 Proceedings of the SIGMETRICS symposium on Parallel and distributed tools
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

Capturing and visualizing event flow graphs of MPI applications

Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
ScalaExtrap: trace-based communication extrapolation for spmd programs

Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
ScalaExtrap: Trace-based communication extrapolation for SPMD programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Runtime detection and optimization of collective communication patterns

Proceedings of the 21st international conference on Parallel architectures and compilation techniques
Bamboo: translating MPI applications to a latency-tolerant, data-driven form

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Semi-automatic extraction of software skeletons for benchmarking large-scale parallel applications

Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimizing the performance of HPC software requires a high-level understanding of communication patterns as well as their relation to source code structures. We describe an algorithm to detect communication patterns in parallel traces and show how these patterns can guide static code analysis. First, we detect patterns that identify potential bottlenecks in MPI communication traces. Next, we associate the patterns with the corresponding nodes in an abstract syntaxtree using the ROSE compiler framework. Finally we perform static analysis on the annotated control flow and system dependence graphs to guide transformations such as code motion or the automatic introduction of MPI collectives.