National Conference on Recent Trends in Engineering and Management |
Foundation of Computer Science USA |
NCRTEM - Number 1 |
August 2013 |
Authors: Amit Chaturvedi, Syed Sajad Hussain |
3261b8b1-9d87-4fca-9e79-c76edae66672 |
Amit Chaturvedi, Syed Sajad Hussain . Analysis of Various Non-blocking Coordinated Checkpointing Algorithms for Handling Failures during Checkpointing. National Conference on Recent Trends in Engineering and Management. NCRTEM, 1 (August 2013), 12-15.
A checkpointing algorithm needs to handle many issues for mobile computing such as mobility, low bandwidth of wireless channels, lack of stable storage on mobile hosts, disconnections, limited battery power and high failure rate of mobile hosts. These issues make traditional checkpointing techniques unsuitable for such environments. Minimum-process coordinated checkpointing is a very enchanting approach to introduce fault tolerance in mobile distributed systems transparently. This approach is domino-free, requires at most two checkpoints of a process on stable storage, and forces only a minimum number of processes to take checkpoint. In this paper, various Non-blocking Coordinated Checkpointing Algorithms are analyzed for handling failures during checkpointing, which requires only a minimum number of processes to take permanent checkpoints. In case of a failure, after recovery a consistent global state is found from the existing checkpoints and the system restarts from there.