Progressive Construction of Consistent Global Checkpoints

Authors:
Affiliations:
Venue:
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Year:
1999

Citing 0
Cited 3

On the Minimal Characterization of the Rollback-Dependency Trackability Property

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
FINE: A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems

Journal of Parallel and Distributed Computing
ROS: the rollback-one-step method to minimize the waiting time during debugging long-running parallel programs

VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A checkpoint pattern is an abstraction of the computation performed by a distributed application. A progressive view of this abstraction is formed by a sequence of consistent global checkpoints that may have occurred in this order during the execution of the application. Considering pairs of checkpoints, we have determined that a checkpoint must be observed before another in a progressive view if the former Z-precedes the latter. Based on the Z-precedence and characteristics of the checkpoint pattern, we propose original algorithms for the progressive construction of consistent global checkpoints. We demonstrate that the Z-precedence between a pair of checkpoints is a much simpler way to express the existence of a zigzag path connecting them, and we discuss other advantages of our relation.