Book Chapter10.1007/978-3-540-69738-1_3
Model checking nonblocking MPI programs
Stephen F. Siegel
- 14 Jan 2007
- pp 44-58
TL;DR: A way to apply model checking techniques to parallel programs that use the nonblocking primitives of the Message Passing Interface (MPI) as an extension to the model checker Spin called Mpi-Spin.
read more
Abstract: This paper explores a way to apply model checking techniques to parallel programs that use the nonblocking primitives of the Message Passing Interface (MPI). The method has been implemented as an extension to the model checker Spin called Mpi-Spin. It has been applied to 17 examples from a widely-used textbook on MPI. Many correctness properties of these examples were verified and in two cases nontrivial faults were discovered.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Experimental study on the extraction and distribution of textual domain keywords
TL;DR: Experiments and applications show that TDDF is more effective than the optimal TFIDF in the extraction of domain keywords, which takes document frequency of domain into account.
172
ISP: a tool for model checking MPI programs
Sarvani Vakkalanka,Subodh Sharma,Ganesh Gopalakrishnan,Robert M. Kirby +3 more
- 20 Feb 2008
TL;DR: This paper presents a tool called ISP (in-situ partial order) which aspires to grow into a practical MPI model checker.
87
MPIWiz: subgroup reproducible replay of mpi applications
Ruini Xue,Xuezheng Liu,Ming Wu,Zhenyu Guo,Wenguang Chen,Weimin Zheng,Zheng Zhang,Geoffrey M. Voelker +7 more
- 14 Feb 2009
TL;DR: Subgroup reproducible replay (SRR) is described, a hybrid deterministic replay method that provides the benefits of both data-replay and order-re play while balancing their tradeoffs, and reduces recording overhead by not recording intra-group communication, and reducing replay overhead by limiting the size of each replay group.
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Greg Bronevetsky
- 22 Mar 2009
TL;DR: The proposed framework bridges the gap between prior work on parallel runtime systems and sequential dataflow analyses, enabling new transformations, runtime optimizations and bug detection tools that require knowledge of the application's communication topology.
72
Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs
Vojtĕch Forejt,Daniel Kroening,Ganesh Narayanaswamy,Subodh Sharma +3 more
- 12 May 2014
TL;DR: This paper shows that if an MPI program is single-path, the problem of discovering communication deadlocks is NP-complete, and presents a novel propositional encoding scheme which captures the existence of communication deadlock.
References
Analysis of Recursive Game Graphs Using Data Flow Equations
Kousha Etessami
- 11 Jan 2004
TL;DR: In this paper, a finite-state abstraction of a sequential program with potentially recursive procedures and input from the environment is checked statically whether there are input sequences that can drive the system into "bad/good" executions.
1.1K
ACSAR: software model checking with transfinite refinement
Mohamed Nassim Seghir,Andreas Podelski +1 more
- 01 Jul 2007
TL;DR: The idea behind ACSAR is to abstract not just states but also the state changes induced by structured program statements, including for- and while-statements, which allows one to shortcut such a “transfinite” sequence of refinement steps.
•Book
MPI - The Complete Reference: Volume 1, The MPI Core
Marc Snir,Marc Snir,Steve W. Otto,Steven Huss-Lederman,David W. Walker,Jack Dongarra +5 more
- 19 Sep 1998
TL;DR: This volume, the definitive reference manual for the latest version of MPI-1, contains a complete specification of the MPI Standard, annotated with comments that clarify complicated issues, including why certain design choices were made, how users are intended to use the interface, and how they should construct their version ofMPI.
468
Verification of MPI-Based Software for Scientific Computation
Stephen F. Siegel,George S. Avrunin +1 more
- 01 Apr 2004
TL;DR: This paper examines a small parallel program that computes the evolution in time of a discretized function defined on a 2-dimensional domain and governed by the diffusion equation, and discusses the modeling of these features and uses Spin and INCA to verify several correctness properties.
Related Papers (5)
Stephen F. Siegel,George S. Avrunin +1 more
- 01 Apr 2004
Gerard J. Holzmann
- 01 May 1997
Stephen F. Siegel
- 30 Sep 2007