A novel non-block synchronous checkpointing scheme for distributed systems
B. Gupta, S. Rahimi · International Conference on Systems · 2005
In this paper, we have proposed a new approach toward designing a simple and efficient nonblock synchronous checkpointing algorithm for distributed systems. In general, such algorithms require all processes to take checkpoints, even though some of them may not be necessary. In the present work, if a process since its last checkpoint has sent some message(s), but none of which has yet been received, the process does not take a checkpoint. It reduces the number of checkpoints to be taken. This approach offers advantage particularly in case of mobile computing environment where both non-block checkpointing and reduction in the number of checkpoints help in the efficient use of the limited resources of mobile computing environment.