A Fast and Efficient Non-Blocking Coordinated Movement-Based Check pointing Approach for Distributed Systems
Jayanta Datta, Harinandan Tunga · 2012
In this paper, we have presented an efficient non-blocking coordinated check pointing algorithm for distributed systems. It produces a consistent set of checkpoints, without the overhead of taking temporary checkpoints; the algorithm also makes sure that only few processes are required to take checkpoints in its any execution; it uses very few control messages and the participating processes are interrupted fewer number of times when compared to some noted related works. The two most important criteria are non-blocking and minimum number of checkpoints. Cao-Singhal showed in their algorithm that it is impossible to design minimum process non-blocking algorithm but it is not desirable in mobile environment that underlying computation will be blocked whenever a check pointing algorithm invoked. If the check pointing scheme is blocking then the performance of the system will be highly affected by the frequent initiation of check pointing algorithm. We must try to minimize the blocking time while keeping the number of checkpoints minimum. So, the proposed scheme concentrate to minimize this overhead by combining coordinated check pointing with minimum blocking time.