Synchronization Error Detection of MPI Programs by Symbolic Execution

Fu, Xianjin; Chen, Zhenbang; Huang, Chun; Dong, Wei; Wang, Ji

doi:10.1109/apsec.2014.28

Cited by 3 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Still, the requirement to modify "global" objects via collective operations on clearly scoped communicators is a fairly elegant solution to the problem of defining the ordering of such operations. It is still possible to run into synchronization issues, but the clear model helps in isolating these [3,8]. The MPI approach is not applicable in OCR, as there are no communicators in OCR and no collective calls.…”

Section: Introductionmentioning

confidence: 99%

Consistency model for runtime objects in the Open Community Runtime

Dokulil

2018

J Supercomput

View full text Add to dashboard Cite

Task-based runtime systems are seen as a way to deal with increasing heterogeneity and performance variability in modern high performance computing systems. The Open Community Runtime is an example of such runtime system, with the benefit of having an open specification that defines its interface and behavior. This allows others to study the design and create alternative implementations of the runtime system. However, it turns out that the consistency model that defines how the OCR programs are synchronized when executed in parallel is not sufficiently defined. In the following text, we complete the consistency model by filling in the missing pieces and extending the memory model given in the specification.

show abstract

Section: Introductionmentioning

confidence: 99%

Consistency model for runtime objects in the Open Community Runtime

Dokulil

2018

J Supercomput

View full text Add to dashboard Cite

show abstract

Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs

Forejt¹,

Joshi

Kroening

et al. 2017

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

The Message Passing Interface (MPI) is the standard API for parallelization in high-performance and scientific computing. Communication deadlocks are a frequent problem in MPI programs, and this article addresses the problem of discovering such deadlocks. We begin by showing that if an MPI program is single path, the problem of discovering communication deadlocks is NP-complete. We then present a novel propositional encoding scheme that captures the existence of communication deadlocks. The encoding is based on modeling executions with partial orders and implemented in a tool called MOPPER . The tool executes an MPI program, collects the trace, builds a formula from the trace using the propositional encoding scheme, and checks its satisfiability. Finally, we present experimental results that quantify the benefit of the approach in comparison to other analyzers and demonstrate that it offers a scalable solution for single-path programs.

show abstract