Forejt, Vojtech and Joshi, Saurabh and Korening, Daniel and Narayaswamy, Ganesh and Sharma, Subodh
(2018)
Precise Predictive Analysis for Discovering Communication
Deadlocks in MPI Programs.
ACM Transactions on Programming Languages and Systems.
(In Press)
Full text not available from this repository.
(
Request a copy)
Abstract
Distributed systems are often developed using the
message passing
paradigm, where
the only way to share data between processes is by passing messages over a network.
Message passing generally leads to modular, decentralized designs owing to its shared-
nothing-by-default model.
The Message Passing Interface (MPI) [Message Passing Interface Forum 2009] is
the
lingua franca
of high-performance computing (HPC) and remains one of the most
widely used APIs for building distributed message-passing applications.
However, message passing systems are hard to design as they require implementing
and debugging complex protocols. These protocols and their interleaved executions
are often non-trivial to analyse as the safety and liveness properties of such systems
are usually violated only during some intricate, low-probability interleavings. Given
the wide adoption of the MPI in large-scale studies in science and engineering, it is
important to have means to establish some formal guarantees, like deadlock-freedom,
on the behaviour of MPI programs.
Actions (login required)
|
View Item |