Correctness Debugging of Message Passing Programs Using Model Verification Techniques

Lovas, Róbert; Kacsuk, Péter

doi:10.1007/978-3-540-75416-9_45

Cited by 2 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, the maintenance phase of cloud infrastructures is to be studied. Finally, the formerly defined formal background for macrostep has to be adapted [33] in the new scenario along with experimental large scale validation.…”

Section: Discussionmentioning

confidence: 99%

Fundamentals of a Novel Debugging Mechanism for Orchestrated Cloud Infrastructures with Macrosteps and Active Control

et al. 2021

View full text Add to dashboard Cite

In Infrastructure-as-a-Service (IaaS) clouds, the development process of a ready-to-use and reliable infrastructure might be a complex task due to the interconnected and dependent services that are deployed (and operated later on) in a concurrent way on virtual machines. Different timing conditions may change the overall initialisation method, which can lead to abnormal behaviour or failure in the non-deterministic environment. The overall motivation of our research is to improve the reliability of cloud-based infrastructures with minimal user interactions and significantly accelerate the time-consuming debugging process. This paper focuses on the behaviour of cloud-based infrastructures during their deployment phase and introduces the adaption of a replay, and active control enriched debugging technique, called macrostep, in the field of cloud orchestration in order to provide support for developers troubleshooting deployment-related errors. The fundamental macrostep mechanisms, including the generation of collective breakpoint sets as well as the traversal method for such consistent global states, have been combined with the Occopus cloud orchestrator and the Neo4J graph database. The paper describes the novel approach, the design choices as well as the implementation of the experimental debugger tool with a use case for validation purposes by providing some preliminary numerical results.

show abstract

Section: Discussionmentioning

confidence: 99%

Fundamentals of a Novel Debugging Mechanism for Orchestrated Cloud Infrastructures with Macrosteps and Active Control

et al. 2021

View full text Add to dashboard Cite

show abstract

“…IMC records communication during execution and checks the trace to identify predefined errors [6]. Several recent efforts have also explored the use of model checking to verify MPI applications [23,29,33,35,34] to verify MPI codes. Though it is difficult for these tools to handle bugs due to non-determinism, they are helpful in application understanding and deterministic bug tracking.…”

Section: Related Workmentioning

confidence: 99%

MPIWiz

Xue

Liu

et al. 2009

Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

Message Passing Interface (MPI) is a widely used standard for managing coarse-grained concurrency on distributed computers. Debugging parallel MPI applications, however, has always been a particularly challenging task due to their high degree of concurrent execution and non-deterministic behavior. Deterministic replay is a potentially powerful technique for addressing these challenges, with existing MPI replay tools adopting either data-replay or order-replay approaches. Unfortunately, each approach has its tradeoffs. Data-replay generates substantial log sizes by recording every communication message. Order-replay generates small logs, but requires all processes to be replayed together. We believe that these drawbacks are the primary reasons that inhibit the wide adoption of deterministic replay as the critical enabler of cyclic debugging of MPI applications.This paper describes subgroup reproducible replay (SRR), a hybrid deterministic replay method that provides the benefits of both data-replay and order-replay while balancing their trade-offs. SRR divides all processes into disjoint groups. It records the contents of messages crossing group boundaries as in data-replay, but records just message orderings for communication within a group as in order-replay. In this way, SRR can exploit the communication locality of traffic patterns in MPI applications. During replay, developers can then replay each group individually. SRR reduces recording overhead by not recording intra-group communication, and reduces replay overhead by limiting the size of each replay group. Exposing these tradeoffs gives the user the necessary control for making deterministic replay practical for MPI applications.We have implemented a prototype, MPIWIZ, to demonstrate and evaluate SRR. MPIWIZ employs a replay framework that allows transparent binary instrumentation of both library and system calls. As a result, MPIWIZ replays MPI applications with no source code modification and relinking, and handles nondeterminism in both MPI and OS system calls. Our preliminary results show that MPIWIZ can reduce recording overhead by over a factor of four relative to data-replay, yet without requiring the entire application to be replayed as in order-replay. Recording increases execution time by 27% while the application can be replayed in just 53% of its base execution time.

show abstract

Correctness Debugging of Message Passing Programs Using Model Verification Techniques

Cited by 2 publications

References 7 publications

Fundamentals of a Novel Debugging Mechanism for Orchestrated Cloud Infrastructures with Macrosteps and Active Control

Fundamentals of a Novel Debugging Mechanism for Orchestrated Cloud Infrastructures with Macrosteps and Active Control

MPIWiz

Contact Info

Product

Resources

About