Kailash Prasad Dewangan, Somesh Kumar Dewangan
email@example.com , firstname.lastname@example.org
Kailash Prasad Dewangan1, Somesh Kumar Dewangan2
1Department of Computer Science & Engineering, Kruti Institute of Technology and Engineering, Raipur (C.G.), India,
2Department of Computer Science & Engineering, Disha Institute of Management and Technology, Raipur (C.G.), India,
Volume - 5,
Issue - 3,
Year - 2013
Rollback-recovery in mobile systems is important for fault-tolerant computing. Without fault tolerance mechanisms, an application running on a system has to be restarted from scratch if a fault happens in the middle of its execution, resulting in loss of useful computation. To provide efficient rollback-recovery for fault-tolerance in distributed systems, it is significant to reduce the number of checkpoints under the existence of consistent global checkpoints in distributed checkpointing algorithms. Because of the dependencies among the processes states that induced by inter-process communication in distributed systems, asynchronous checkpointing may suffer from the domino effect. Therefore, a consistent global checkpoint should always be ensured to restrict the rollback distance. The quasi-synchronous checkpointing protocols achieve synchronization in a loose fashion. The algorithm proposed in this paper follows a new strategy to update the checkpoint interval dynamically.
Cite this article:
Kailash Prasad Dewangan, Somesh Kumar Dewangan. Enhanced Checkpointing Algorithm for Mobile Applications. Research J. Science and Tech 5(3): July- Sept., 2013 page 352-357.
Kailash Prasad Dewangan, Somesh Kumar Dewangan. Enhanced Checkpointing Algorithm for Mobile Applications. Research J. Science and Tech 5(3): July- Sept., 2013 page 352-357. Available on: https://rjstonline.com/AbstractView.aspx?PID=2013-5-3-14