Abstract

In the paper, we consider the problem of searching for places for creation of consistent checkpoints by analyzing the trace of execution of a parallel program. We investigate the problems of construction of the program trace, analysis of the trace obtained, and interpretation of results of the analysis for deterministic MPI-programs. We also describe some approaches to analysis of nondeterministic programs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call