Abstract:-Analysis of Some Minimum-process Coordinated Checkpointing Algorithms for Mobile

Friday, 26 August 2011 10:11 administrator
Print PDF
Abstract- Checkpoint is defined as a designated place in a program at which normal process is interrupted specifically to preserve the status information necessary to allow resumption of processing at a later time. A distributed system is a collection of independent entities that cooperate to solve a problem that cannot be individually solved. A mobile computing system is a distributed system where some of processes are running on mobile hosts (MHs). The existence of mobile nodes in a distributed system introduces new issues that need proper handling while designing a checkpointing algorithm for such systems. These issues are mobility, disconnections, finite power source, vulnerable to physical damage, lack of stable storage etc. Recently, more attention has been paid to providing checkpointing protocols for mobile systems. Minimum-process coordinated
checkpointing is an attractive 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 checkpoint. But, it requires extra synchronization messages, blocking of the underlying computation or taking some useless checkpoints. In this paper, we carry out the literature survey of some Minimumprocess Coordinated Checkpointing Algorithms for Mobile Computing Systems.
Attachments:
Download this file (Analysis of Some Minimum-process Coordinated.pdf)Analysis of Some Minimum-process Coordinated.pdf[Parveen, Praveen Kumar NIMS University, Jaipur (Rajasthan India Meerut Institute of Engineering & Technology, Meerut (INDIA)-250005]821 Kb
Last Updated on Thursday, 20 October 2011 10:26