Determining Z-Paths Between Checkpoints of a Distributed Computation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Finding consistent global checkpoints of a distributed computation has applications in the areas of rollback recovery, distributed debugging, output commit and others. Netzer and Xu introduced the notion of zigzag paths between checkpoints and proved that a set of checkpoints can be part of a consistent global checkpoint if and only if there is no zigzag path between any two (not necessarily distinct) checkpoints in the set. In this paper, we present a method for determining the existence of zigzag paths between checkpoints.

Original languageEnglish
Title of host publicationProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000, Volume 1
EditorsP.P. Wang, P.P. Wang
Pages398-401
Number of pages4
Edition1
StatePublished - 2000
EventProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000 - Atlantic City, NJ, United States
Duration: Feb 27 2000Mar 3 2000

Publication series

NameProceedings of the Joint Conference on Information Sciences
Number1
Volume5

Conference

ConferenceProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000
Country/TerritoryUnited States
CityAtlantic City, NJ
Period2/27/003/3/00

Keywords

  • Causality
  • Distributed checkpointing
  • Failure recovery
  • Fault-tolerance
  • Global snapshot collection

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Determining Z-Paths Between Checkpoints of a Distributed Computation'. Together they form a unique fingerprint.

Cite this