AN EFFICIENT PROTOCOL FOR CHECKPOINTING RECOVERY IN DISTRIBUTED SYSTEMS

This paper presents a new efficient synchronized checkpointing protocol which exploits the dependency relation between processes in distributed systems. In our protocol, a process takes a checkpoint when it knows that all processes on which it computationally depends took their checkpoints, and hence the process need not always wait for the decision made by the checkpointing coordinator as in the conventional synchronized protocols. As a result, the checkpointing coordination time is substantially reduced and the possibility of total abort of the checkpointing coordination is reduced.