MPI Runtime Error Detection with MUST: Advances in Deadlock Detection

Journal Article · Tue Jan 01 00:00:00 EST 2013 · Scientific Programming

DOI:https://doi.org/10.1155/2013/314971· OSTI ID:1197888

Hilbrich, Tobias ^[1]; Protze, Joachim ^[2]; Schulz, Martin ^[3]; de Supinski, Bronis R. ^[3]; Müller, Matthias S. ^[2]

---

1. Technische Universität Dresden, Dresden, Germany
2. Technische Universität Dresden, Dresden, Germany, RWTH Aachen University, Aachen, Germany, JARA – High Performance Computing, Aachen, Germany
3. Lawrence Livermore National Laboratory, Livermore, CA, USA

The widely used Message Passing Interface (MPI) is complex and rich. As a result, application developers require automated tools to avoid and to detect MPI programming errors. We present the Marmot Umpire Scalable Tool (MUST) that detects such errors with significantly increased scalability. We present improvements to our graph-based deadlock detection approach for MPI, which cover future MPI extensions. Our enhancements also check complex MPI constructs that no previous graph-based detection approach handled correctly. Finally, we present optimizations for the processing of MPI operations that reduce runtime deadlock detection overheads. Existing approaches often require 𝒪( p ) analysis time per MPI operation, for p processes. We empirically observe that our improvements lead to sub-linear or better analysis time per operation for a wide range of real world applications.

• Sponsoring Organization: USDOE
• Grant/Contract Number: AC52-07NA27344; 287703
• OSTI ID: 1197888
• Journal Information: Scientific Programming, Journal Name: Scientific Programming Vol. 21 Journal Issue: 3-4; ISSN 1058-9244
• Publisher: Hindawi Publishing Corporation
• Country of Publication: Egypt
• Language: English