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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Dakshnamoorthy MANIVANNAN, "Determining Consistent Global Checkpoints of a Distributed Computation" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 1, pp. 164-174, January 2004, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e87-d_1_164/_p
Copy
@ARTICLE{e87-d_1_164,
author={Dakshnamoorthy MANIVANNAN, },
journal={IEICE TRANSACTIONS on Information},
title={Determining Consistent Global Checkpoints of a Distributed Computation},
year={2004},
volume={E87-D},
number={1},
pages={164-174},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Determining Consistent Global Checkpoints of a Distributed Computation
T2 - IEICE TRANSACTIONS on Information
SP - 164
EP - 174
AU - Dakshnamoorthy MANIVANNAN
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2004
AB - 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.
ER -