A graph based approach for MPI deadlock detection

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2009, Pages 296-305

  Hilbrich, Tobias ^a   De Supinski, Bronis R ^b   Schulz, Martin ^b   Müller, Matthias S ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

Deadlock detection; MPI; Parallel programming; Umpire

Indexed keywords

COLLECTIVE COMMUNICATIONS; DEADLOCK DETECTION; DEADLOCK MODELS; GRAPH-BASED; MPI PROGRAMS; NON-DETERMINISM; ORDERS OF MAGNITUDE; SUFFICIENT CRITERION; USAGE PATTERNS;

INTELLIGENT CONTROL; MACHINE DESIGN;

PARALLEL PROGRAMMING;

EID: 70449713896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542275.1542319     Document Type: Conference Paper

References (20)

1. SPEC MPI2007 Benchmark Suite for MPI. http://www.spec.org/mpi2007/.
2. D. H. Bailey, L. Dagum, E. Barszcz, and H. D. Simon. Nas parallel benchmark results. Technical report, IEEE Parallel and Distributed Technology, 1992.
3. V. C. Barbosa and M. R. F. Benevides. A graph-theoretic characterization of AND-OR deadlocks. 1998.
4. H. Brunst, D. Kranzlmüller, and W. Nagel. Tools for Scalable Parallel Program Analysis - Vampir NG and DeWiz. The International Series in Engineering and Computer Science, Distributed and Parallel Systems, 777:92-102, 2005.
5. W. Haque. Concurrent deadlock detection in parallel programs. Int. J. Comput. Appl., 28(1):19-25, 2006.
6. T. Hilbrich Centralized Deadlock Detection for MPI Applications: Complexity and Parallelization. Diploma thesis, Technische Universität Dresden, Oct. 2008.
7. Intel Corporation. Intel R Trace Collector 7.1 User's Guide.
8. B. Krammer and M. S. Müller. MPI Application Development with MARMOT. In G. R. Joubert, W. E. Nagel, F. J. Peters, O. G. Plata, P. Tirado, and E. L. Zapata, editors, PARCO, volume 33 of John von Neumann Institute for Computing Series, pages 893-900. Central Institute for Applied Mathematics, Jülich, Germany, 2005.
9. Lawrence Livermore National Laboratory. The ASCI purple benchmark codes. http://www.llnl.gov/asci/purple/benchmarks/ limited/code list.html, Oct. 2002.
10. S. Lee. Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model. IEEE Trans. Softw. Eng., 30(9):561-573, 2004.
11. G. R. Luecke, Y. Zou, J. Coyle, J. Hoekstra, and M. Kraeva. Deadlock detection in MPI programs. Concurrency and Computation: Practice and Experience, 14:911-932, 2002.
12. Message Passing Interface Forum. MPI: A Message-Passing Interface Standard, Version 2.1. http://www.mpi-forum.org/docs/mpi21-report.pdf, September 2008.
13. W. E. Nagel, A. Arnold, M. Weber, H. C. Hoppe, and K. Solchenbach. VAMPIR: Visualization and analysis of MPI resources. Supercomputer, 12(1):69-80, 1996.
14. M. Schulz and B. R. de Supinski. PNMPI tools a whole lot greater than the sum of their parts. In Supercomputing 2007 (SC'07), 2007.
15. S. Siegel. Using MPI-Spin to Model Check MPI Programs with Nonblocking Communication. In Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI), September 2006.
16. M. Singhal. Deadlock detection in distributed systems. Computer, 22(11):37-48, 1989.
17. S. Vakkalanka, M. DeLisi, G. Gopalakrishnan, R. Kirby, R. Thakur, and W. Gropp. Implementing Efficient Dynamic Formal Verification Methods for MPI Programs. In Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI), pages 248-256, September 2008.
18. J. Vetter and C. Chambreau. mpiP: Lightweight, Scalable MPI Profiling. http://www.llnl.gov/CASC/mpip/, Apr. 2005.
19. J. Vetter and B.R. de Supinski. Dynamic Software Testing of MPI Applications with Umpire. Supercomputing, ACM/IEEE 2000 Conference, pages 51-51, 04-10 Nov. 2000.
20. O. Zaki, E. Lusk, W. Gropp, and D. Swider. Toward Scalable Performance Visualization with Jumpshot. International Journal of High Performance Computing Applications, 13(3):277-288, 1999.