A Sound Reduction of Persistent-Sets for Deadlock Detection in MPI Applications

Sharma, Subodh; Gopalakrishnan, Ganesh; Bronevetsky, Greg

doi:10.1007/978-3-642-33296-8_15

Cited by 8 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are dynamic detectors that detect deadlocks in MPI programs [13,25,26,64,70], where MPI (message passing interface) is a library that helps create parallel programs in C or Fortran77.…”

Section: Related Workmentioning

confidence: 99%

Who goes first? detecting go concurrency bugs via message reordering

Liu

Xia

Liang

et al. 2022

Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

View full text Add to dashboard Cite

Go is a young programming language invented to build safe and efficient concurrent programs. It provides goroutines as lightweight threads and channels for inter-goroutine communication. Programmers are encouraged to explicitly pass messages through channels to connect goroutines, with the purpose of reducing the chance of making programming mistakes and introducing concurrency bugs. Go is one of the most beloved programming languages and has already been used to build many critical infrastructure software systems in the data-center environment. However, a recent study shows that channel-related concurrency bugs are still common in Go programs, severely hurting the reliability of the programs.This paper presents GFuzz, a dynamic detector that can effectively pinpoint channel-related concurrency bugs by mutating the processing orders of concurrent messages. We build GFuzz in three steps. We first adopt an effective approach to identify concurrent messages and transform a program to process those messages in any given order. We then take a fuzzing approach to generate new processing orders by mutating exercised ones and rely on execution feedback to prioritize orders close to triggering bugs. Finally, we design a runtime sanitizer to capture triggered bugs that are missed by the Go runtime. We evaluate GFuzz on seven popular Go software systems, including Docker, Kubernetes, and gRPC. GFuzz finds 184 previously unknown bugs and reports a negligible number of false positives. Programmers have already confirmed 124 reports as real bugs and fixed 67 of them based on our reporting. A careful inspection of the detected concurrency bugs from gRPC shows the effectiveness of each component of GFuzz and confirms the components' rationality. CCS CONCEPTS• Software and its engineering → Software testing and debugging; Software reliability.

show abstract

Section: Related Workmentioning

confidence: 99%

Who goes first? detecting go concurrency bugs via message reordering

Liu

Xia

Liang

et al. 2022

Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

View full text Add to dashboard Cite

show abstract

“…Both of the tools suffer from interleaving explosion, where some execution schedule expands exponentially. MSPOE [34] improves on ISP's partial ordering algorithm to overcome the defect and detect orphaning deadlocks. All above tools are test-based and verify correctness with a fixed harness suite.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Protocols by Default

Coutinho

Yoshida

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper presents a code generation framework for typesafe and deadlock-free Message Passing Interface (MPI) programs. The code generation process starts with the definition of the global topology using a protocol specification language based on parameterised multiparty session types (MPST). An MPI parallel program backbone is automatically generated from the global specification. The backbone code can then be merged with the sequential code describing the application behaviour, resulting in a complete MPI program. This merging process is fully automated through the use of an aspect-oriented compilation approach. In this way, programmers only need to supply the intended communication protocol and provide sequential code to automatically obtain parallelised programs that are guaranteed free from communication mismatch, type errors or deadlocks. The code generation framework also integrates an optimisation method that overlaps communication and computation, and can derive not only representative parallel programs with common parallel patterns (such as ring and stencil), but also distributed applications from any MPST protocols. We show that our tool generates efficient and scalable MPI applications, and improves productivity of programmers. For instance, our benchmarks involving representative parallel and application-specific patterns speed up sequential execution by up to 31 times and reduce programming effort by an average of 39%.

show abstract

“…A significant subset of MPI primitives is considered, formally specified in order to define the dependency relation, and then to use the DPOR technique of [7]. In [18], the efficiency is improved by focusing on particular deadlocks, but at the price of incompleteness.…”

Section: Introductionmentioning

confidence: 99%

Unfolding-Based Dynamic Partial Order Reduction of Asynchronous Distributed Programs

Jéron

Quinson

2019

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

Unfolding-based Dynamic Partial Order Reduction (UDPOR) is a recent technique mixing Dynamic Partial Order Reduction (DPOR) with concepts of concurrency such as unfoldings to efficiently mitigate state space explosion in model-checking of concurrent programs. It is optimal in the sense that each Mazurkiewicz trace, i.e. a class of interleavings equivalent by commuting independent actions, is explored exactly once. This paper shows that UDPOR can be extended to verify asynchronous distributed applications, where processes both communicate by messages and synchronize on shared resources. To do so, a general model of asynchronous distributed programs is formalized in TLA+. This allows to define an independence relation, a main ingredient of the unfolding semantics. Then, the adaptation of UDPOR, involving the construction of an unfolding, is made efficient by a precise analysis of dependencies. A prototype implementation gives promising experimental results.

show abstract

A Sound Reduction of Persistent-Sets for Deadlock Detection in MPI Applications

Cited by 8 publications

References 12 publications

Who goes first? detecting go concurrency bugs via message reordering

Who goes first? detecting go concurrency bugs via message reordering

Protocols by Default

Unfolding-Based Dynamic Partial Order Reduction of Asynchronous Distributed Programs

Contact Info

Product

Resources

About