Progressive construction of consistent global checkpoints

Garcia, Islene C.; Buzato, Luiz Eduardo

doi:10.1109/icdcs.1999.776506

Cited by 9 publications

(13 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…P 3 keeps track that it has searched sr-entry of 4.  sr [4] contains only 3 whose sr-entry has already been searched and 2 was not in sr [3].  Concludes that P 3 does not have to roll back.…”

Section: Process Id Message Sent To (Pid)mentioning

confidence: 93%

“…No special synchronization messages have been used in those methods but the existing clock synchronization messages were utilized. The work described in [4] however, allows processes to take checkpoints on one's own and then a consistent global checkpoint is constructed from the set of local checkpoints. The drawback of the method is that useless checkpoints can not be avoided.…”

Section: Related Workmentioning

confidence: 99%

“…P 3 :  Searches own sr entry to find if 2 exists there.  Since 2 is not there, so search the entry of sr [4] since 4 occurs in P 3 's sr-entry. P 3 keeps track that it has searched its own sr-entry.…”

Section: Process Id Message Sent To (Pid)mentioning

confidence: 99%

“…P 3 keeps track that it has searched its own sr-entry.  Since 2 is not in sr [4], so search the entry of sr [3] since 3 occurs in P 4 's sr-entry. P 3 keeps track that it has searched sr-entry of 4.…”

Section: Process Id Message Sent To (Pid)mentioning

confidence: 99%

“…This removes inconsistency, if any, and then checkpoints are committed. The technique adopted in the present paper thus disallows the formation of neither zigzag paths nor zigzag cycle [4,11]. The checkpointing pattern described in the present paper takes only those checkpoints that will contribute to a consistent global snapshot thereby eliminating the number of -useless‖ (checkpoints that do not contribute to global consistency) checkpoints.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Checkpointing with Minimal Recovery in Adhoc Net Based TMR

Neogy¹

2015

IJU

View full text Add to dashboard Cite

This paper describes two-fold approach towards utilizing Triple Modular Redundancy (TMR) in Wireless Adhoc Network (AdocNet). A distributed checkpointing and recovery protocol is proposed. The protocol eliminates useless checkpoints and helps in selecting only dependent processes in the concerned checkpointing interval, to recover. A process starts recovery from its last checkpoint only if it finds that it is dependent (directly or indirectly) on the faulty process. The recovery protocol also prevents the occurrence of missing or orphan messages. In AdocNet, a set of three nodes (connected to each other) is considered to form a TMR set, being designated as main, primary and secondary. A main node in one set may serve as primary or secondary in another. Computation is not triplicated, but checkpoint by main is duplicated in its primary so that primary can continue if main fails. Checkpoint by primary is then duplicated in secondary if primary fails too.

show abstract

Section: Process Id Message Sent To (Pid)mentioning

confidence: 93%

Section: Related Workmentioning

confidence: 99%

Section: Process Id Message Sent To (Pid)mentioning

confidence: 99%

Section: Process Id Message Sent To (Pid)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations