Progressive construction of consistent global checkpoints

摘要

A checkpoint pattern is an abstraction of the computationperformed by a distributed application. A progressive view of thisabstraction is formed by a sequence of consistent global checkpointsthat may have occurred in this order during the execution of theapplication. Considering pairs of checkpoints, we have determined that acheckpoint must be observed before another in a progressive view if theformer Z-precedes the latter. Based on the Z-precedence andcharacteristics of the checkpoint pattern, we propose originalalgorithms for the progressive construction of consistent globalcheckpoints. We demonstrate that the Z-precedence between a pair ofcheckpoints is a much simpler way to express the existence of a zigzagpath connecting them, and we discuss other advantages of our relation