A sound reduction of persistent-sets for deadlock detection in MPI applications

Authors:
Subodh Sharma;Ganesh Gopalakrishnan;Greg Bronevetsky
Affiliations:
University of Oxford, UK;University of Utah;Lawrence Livermore National Laboratory
Venue:
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Year:
2012

Citing 12
Cited 0

Parallel multilevel k-way partitioning scheme for irregular graphs

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Dynamic partial-order reduction for model checking software

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improving distributed memory applications testing by message perturbation

Proceedings of the 2006 workshop on Parallel and distributed systems: testing and debugging
Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Formal verification of practical MPI programs

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications

Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization
A Scalable and Distributed Dynamic Formal Verifier for MPI Programs

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Efficient dynamic verification algorithms for mpi applications

Efficient dynamic verification algorithms for mpi applications
Formal analysis of MPI-based parallel programs

Communications of the ACM
SAGE: whitebox fuzzing for security testing

Communications of the ACM
Large Scale Verification of MPI Programs Using Lamport Clocks with Lazy Update

PACT '11 Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Formal dynamic analysis of Message Passing Interface (MPI) programs is crucially important in the context of developing HPC applications. Existing dynamic verification tools for MPI programs suffer from exponential schedule explosion, especially when multiple non-deterministic receive statements are issued by a process. In this paper, we focus on detecting message-orphaning deadlocks within MPI programs. For this analysis target, we describe a sound heuristic that helps avoid schedule explosion in most practical cases while not missing deadlocks in practice. Our method hinges on initially computing the potential non-deterministic matches as conventional dynamic analyzers do, but then including only the entries which are found relevant to cause a refusal deadlock (essentially a macroscopic-view persistent-set reduction technique). Experimental results are encouraging.