dMPI: Facilitating Debugging of MPI Programs via Deterministic Message Passing

Abstract : This paper presents a novel deterministic MPI implementation (dMPI) to facilitate the debugging of MPI programs. Distinct from existing approaches, dMPI ensures inherent determinism without using any external support (e.g., logs), which achieves convenience and performance simultaneously. The basic idea of dMPI is to use deterministic logical time to solve message races and control asynchronous transmissions, thus we could eliminate the nondeterministic behaviors of the existing message passing mechanism. To avoid deadlocks introduced by dMPI, we also integrate dMPI with a lightweight deadlock checker to dynamically detect and solve these deadlocks. We have implemented dMPI and evaluated it using NPB benchmarks. The results show that dMPI could guarantee determinism with incurring modest overhead (8% on average).
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01551348
Contributor : Hal Ifip <>
Submitted on : Friday, June 30, 2017 - 10:35:59 AM
Last modification on : Tuesday, September 3, 2019 - 3:04:02 PM
Long-term archiving on : Monday, January 22, 2018 - 8:42:35 PM

File

978-3-642-35606-3_20_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Xu Zhou, Kai Lu, Xicheng Lu, Xiaoping Wang, Baohua Fan. dMPI: Facilitating Debugging of MPI Programs via Deterministic Message Passing. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.172-179, ⟨10.1007/978-3-642-35606-3_20⟩. ⟨hal-01551348⟩

Share

Metrics

Record views

54

Files downloads

188