An Index-Based Checkpointing Algorithm For Autonomous Distributed Systems
SRDS '97 Proceedings of the 16th Symposium on Reliable Distributed Systems
An Efficient Index-Based Checkpointing Protocol with Constant-Size Control Information on Messages
IEEE Transactions on Dependable and Secure Computing
A Two-Phase Time-based Consistent Checkpointing Strategy
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
A low-overhead non-block checkpointing algorithm for mobile computing environment
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Hi-index | 0.00 |
An index-based checkpointing and recovery protocol has been presented that uses time to indirectly coordinate the creation of consistent global checkpoint for mobile computing systems. The protocol is computationally more efficient because it takes fewer checkpoints than many other protocols and does not need to compute dependency relationships. Also, the protocol is non-blocking, adaptive, and uses very few control messages. Moreover, the number of control messages is independent of the increase in the number of mobile hosts and the size of control messages is also small.