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 check-points 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.
| Original language | English |
|---|---|
| Pages (from-to) | 164-174 |
| Number of pages | 11 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E87-D |
| Issue number | 1 |
| State | Published - Jan 2004 |
Keywords
- Causality
- Distributed checkpointing
- Failure recovery
- Fault-tolerance
- Global snapshot collection
- Z-paths
- Zigzag paths
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence