An enhanced model-based checkpointing protocol

Authors:
Jiang Wu;Yi Luo;D. Manivannan
Affiliations:
Department of Computer Science, University of Kentucky, Lexington, KY;Department of Computer Science, University of Kentucky, Lexington, KY;Department of Computer Science, University of Kentucky, Lexington, KY
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 6
Cited 2

Necessary and Sufficient Conditions for Consistent Global Snapshots

IEEE Transactions on Parallel and Distributed Systems
Distributed snapshots: determining global states of distributed systems

ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Rollback-dependency trackability: a minimal characterization and its protocol

Information and Computation
A VP-Accordant Checkpointing Protocol Preventing Useless Checkpoints

SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Communication-based prevention of useless checkpoints in distributed computations

Distributed Computing

FINE: A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems

Journal of Parallel and Distributed Computing
Theoretical and experimental evaluation of communication-induced checkpointing protocols in FE and FLazy-E families

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Checkpointing and rollback recovery are widely used techniques to handle failures in distributed computing systems. Usually we avoid taking checkpoints that are useless during the recovery process. Communication-Induced checkpointing algorithms guarantee the usefulness of all the checkpoints and provide considerable autonomy with relatively low overhead. In this paper, we propose an enhanced Communication-Induced checkpointing algorithm. Our algorithm is likely to have less checkpointing overhead than an existing algorithm in the literature.