Sound and Efficient Dynamic Verification of MPI Programs with Probe Non-determinism

Authors:
Anh Vo;Sarvani Vakkalanka;Jason Williams;Ganesh Gopalakrishnan;Robert M. Kirby;Rajeev Thakur
Affiliations:
School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;Math. and Comp. Sci. Div., Argonne Nat. Lab., Argonne, USA 60439
Venue:
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Year:
2009

Citing 10
Cited 2

The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Dynamic partial-order reduction for model checking software

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scheduling considerations for building dynamic verification tools for MPI

PADTAD '08 Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, 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
Efficient Stateful Dynamic Partial Order Reduction

SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
MADRE: The Memory-Aware Data Redistribution Engine

Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Implementing Efficient Dynamic Formal Verification Methods for MPI Programs

Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A Formal Approach to Detect Functionally Irrelevant Barriers in MPI Programs

Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Formal verification of practical MPI programs

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
MODIST: transparent model checking of unmodified distributed systems

NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation

Reduced Execution Semantics of MPI: From Theory to Practice

FM '09 Proceedings of the 2nd World Congress on Formal Methods
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of verifying MPI programs that use MPI_Probe and MPI_Iprobe . Conventional testing tools, known to be inadequate in general, are even more so for testing MPI programs containing MPI probes. A few reasons are: (i) use of the MPI_ANY_SOURCE argument can make MPI probes non-deterministic, allowing them to match multiple senders, (ii) an MPI_Recv that follows an MPI probe need not match the MPI_Send that was successfully probed, and (iii) simply re-running the MPI program, even with schedule perturbations, is insufficient to bring out all behaviors of an MPI program using probes. We develop several key insights that help develop an elegant solution: prioritizing MPI processes during dynamic verification, handling non-determinism, and safe handling of probe loops. These solutions are incorporated into a new version of our dynamic verification tool ISP. ISP is now able to efficiently and soundly verify larger MPI examples, including MPI-BLAST and ADLB.