%0 Conference Proceedings
%T Design and analysis of an efficient algorithm for coordinated checkpointing in distributed systems
%A Cao Jiannong
%A Jia Weijia
%A Jia Xiaohua
%A Cheung To-yat
%X A synchronous checkpointing algorithm coordinates a set of processes in taking checkpoints in such a way that the set of local checkpoints always forms part of a consistent global system state. Whenever a process p requests to take a checkpoint, a set of processes, called the cohorts set of p, must be checked and some of them may also have to take their checkpoints in order to preserve system consistency. Although several synchronous checkpointing algorithms have been proposed in the literature, most of them do not address the performance issue. In this paper we propose an efficient distributed algorithm for synchronous checkpointing. Proof of correctness and analysis of efficiency of the algorithm are presented. It is shown that the algorithm has a better message and time complexity than the existing algorithms. The method proposed in this paper can also be applied to enhance the performance of rollback operation which always require synchronization of the inter-dependent processes.
%8 1997
%D 1997
%J Proceedings of the Conference on Advances in Parallel and Distributed Computing
%P 261-268
%B Proceedings of the Conference on Advances in Parallel and Distributed Computing
%U http://repository.um.edu.mo/handle/10692/11808
%W UM