Answers are grounded in this paper and cite their sources.
Adaptive message logging, which traces dependences between messages and checkpoints and selectively logs messages, letting users accurately and efficiently replay specific portions of parallel programs, is presented. Traces are reduced by logging only messages that cannot be quickly recomputed during replay. By restarting the execution at the right set of checkpoints, many of the messages needed for a specific replay can be recomputed during the replay itself.>
No takes yet. Share an insight, caveat, or question.
Netzer et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: