Static-Analysis Assisted Dynamic Verification of MPI Waitany Programs (Poster Abstract)

Authors:
Sarvani Vakkalanka;Grzegorz Szubzda;Anh Vo;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 3
Cited 2

Dynamic partial-order reduction for model checking software

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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

Reduced Execution Semantics of MPI: From Theory to Practice

FM '09 Proceedings of the 2nd World Congress on Formal Methods
SAM: self-adaptive dynamic analysis for multithreaded programs

HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that the number of schedules (interleavings) of a concurrent program grows exponentially with the number of processes. Our previous work has demonstrated the advantages of an MPI-specific dynamic partial order reduction (DPOR, [5]) algorithm called POE in a tool called ISP [1,2,3] in dramatically reducing the number of interleavings during formal dynamic verification. Higher degrees of interleaving reduction were achieved when the programs were deterministic . In this work, we consider the problem of verifying MPI using MPI_Waitany (and related operations wait/test some/all). Such programs potentially have a higher degree of non-determinism. For such programs, POE can become ineffective, as shown momentarily. To solve this problem, we employ static analysis (supported by ROSE [4]) in a supporting role to POE to determine the extent to which the out parameters of MPI_Waitany can affect subsequent control flow statements. This informs ISP's scheduler to exert even more intelligent backtrack/replay control.