Pitfalls in Distributed Nonblocking Checkpointing

Ni, Weigang; Vrbsky, Susan V.; Ray, Sid

doi:10.1142/s0219265904001027

Cited by 11 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ni et al [61] have shown that the Cao-Singhal algorithm [20] may lead to inconsistencies during concurrent executions. The authors [61] also updated the algorithm proposed in [20] to allow concurrent executions. The number of useless checkpoints in [20] may be exceedingly high in some situations [48].…”

Section: Related Workmentioning

confidence: 99%

A Review of Fault Tolerant Checkpointing Protocols for Mobile Computing Systems

Garg¹,

Kumar²

2010

IJCA

View full text Add to dashboard Cite

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), whose location in the network changes with time. Mobile distributed systems raise new issues such as mobility, low bandwidth of wireless channels, disconnections, limited battery power and lack of reliable stable storage on mobile nodes. This paper addresses the problem of fault tolerant computing in mobile distributed systems. The techniques described are based on checkpointing and roll back recovery.

show abstract

Section: Related Workmentioning

confidence: 99%

A Review of Fault Tolerant Checkpointing Protocols for Mobile Computing Systems

Garg¹,

Kumar²

2010

IJCA

View full text Add to dashboard Cite

show abstract

“…In case of concurrent initiations, multiple triggers need to be piggybacked on normal messages [26]. Trigger contains the initiator process identification and its csn.…”

Section: Multiple Concurrent Initiationsmentioning

confidence: 99%

Dealing with Frequent Aborts in Minimum-process Coordinated Checkpointing Algorithm for Mobile Distributed Systems

Kumar¹,

Gupta²,

Solanki³

2010

IJCA

View full text Add to dashboard Cite

While dealing with mobile distributed systems, we come across some issues like: mobility, low bandwidth of wireless channels and lack of stable storage on mobile nodes, disconnections, limited battery power and high failure rate of mobile nodes. In this paper, we design a minimum process algorithm for Mobile Distributed systems, where no useless checkpoints are taken and an effort has been made to optimize the blocking of processes. In order to keep the blocking time minimum, we collect the dependency vectors and compute the exact minimum set in the beginning of the algorithm. In coordinated checkpointing, if a single process fails to take its checkpoint; all the checkpointing effort goes waste, because, each process has to abort its tentative checkpoint. In order to take its tentative checkpoint, an MH (Mobile Host) needs to transfer large checkpoint data to its local MSS over wireless channels. The checkpointing effort may be exceedingly high due to frequent aborts especially in mobile systems. We try to minimize the loss of checkpointing effort when any process fails to take its checkpoint in coordination with others

show abstract

“…This will waste the scarce resources of the mobile distributed system. (ii) In case of concurrent initiations, multiple triggers need to be piggybacked on normal messages [23]. Trigger contains the initiator process identification and its csn.…”

Section: Multiple Concurrent Initiationsmentioning

confidence: 99%

“…Concurrent executions of the algorithm are allowed in [5]. W. Ni et al [23] have shown that this algorithm [5] may lead to inconsistencies during concurrent executions.…”

Section: Evaluation Of the Proposed Hybrid Algorithmmentioning

confidence: 99%

A Low‐Cost Hybrid Coordinated Checkpointing Protocol for Mobile Distributed Systems

Kumar

2008

Mobile Information Systems

View full text Add to dashboard Cite

Mobile distributed systems raise new issues such as mobility, low bandwidth of wireless channels, disconnections, limited battery power and lack of reliable stable storage on mobile nodes. In minimum-process coordinated checkpointing, some processes may not checkpoint for several checkpoint initiations. In the case of a recovery after a fault, such processes may rollback to far earlier checkpointed state and thus may cause greater loss of computation. In all-process coordinated checkpointing, the recovery line is advanced for all processes but the checkpointing overhead may be exceedingly high. To optimize both matrices, the checkpointing overhead and the loss of computation on recovery, we propose a hybrid checkpointing algorithm, wherein an all-process coordinated checkpoint is taken after the execution of minimum-process coordinated checkpointing algorithm for a fixed number of times. Thus, the Mobile nodes with low activity or in doze mode operation may not be disturbed in the case of minimum-process checkpointing and the recovery line is advanced for each process after an all-process checkpoint. Additionally, we try to minimize the information piggybacked onto each computation message. For minimum-process checkpointing, we design a blocking algorithm, where no useless checkpoints are taken and an effort has been made to optimize the blocking of processes. We propose to delay selective messages at the receiver end. By doing so, processes are allowed to perform their normal computation, send messages and partially receive them during their blocking period. The proposed minimum-process blocking algorithm forces zero useless checkpoints at the cost of very small blocking.

show abstract

Pitfalls in Distributed Nonblocking Checkpointing

Cited by 11 publications

References 17 publications

A Review of Fault Tolerant Checkpointing Protocols for Mobile Computing Systems

A Review of Fault Tolerant Checkpointing Protocols for Mobile Computing Systems

Dealing with Frequent Aborts in Minimum-process Coordinated Checkpointing Algorithm for Mobile Distributed Systems

A Low‐Cost Hybrid Coordinated Checkpointing Protocol for Mobile Distributed Systems

Contact Info

Product

Resources

About