Determining Consistent Global Checkpoints of a Distributed Computation

Dakshnamoorthy MANIVANNAN

  • Full Text Views

    0

  • Cite this

Summary :

Determining consistent global checkpoints of a distributed computation has applications in the areas such as rollback recovery, distributed debugging, output commit and others. Netzer and Xu introduced the notion of zigzag paths and presented necessary and sufficient conditions for a set of checkpoints to be part of a consistent global checkpoint. This result also reveals that determining the existence of zigzag paths between checkpoints is crucial for determining consistent global checkpoints. Recent research also reveals that determining zigzag paths on-line is not possible. In this paper, we present an off-line method for determining the existence of zigzag paths between checkpoints.

Publication
IEICE TRANSACTIONS on Information Vol.E87-D No.1 pp.164-174
Publication Date
2004/01/01
Publicized
Online ISSN
DOI
Type of Manuscript
PAPER
Category
Computer Systems

Authors

Keyword

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.