FINE: A Fully Informed aNd Efficient Communication-Induced Checkpointing Protocol

Authors:
Yi Luo;D. Manivannan
Affiliations:
-;-
Venue:
ICONS '08 Proceedings of the Third International Conference on Systems
Year:
2008

Citing 0
Cited 3

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

Journal of Parallel and Distributed Computing
Necessary and sufficient conditions for transaction-consistent global checkpoints in a distributed database system

Information Sciences: an International Journal
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

In this paper, first we discuss two critical data structures used in the Communication-Induced Checkpointing (CIC) protocols and their distinct roles in guaranteeing Z-Cycle Free (ZCF) property by tracking the checkpoint and communication pattern (CCPAT) in a distributed computation that can lead to Z-cycles and preventing them. Then, we provide our Transitive Dependency Enabled TimeStamp (T DE_TS) mechanism by which we can both timestamp each event and get the transitive dependency information upon receiving a message. Finally, based on this timestamping mechanism, we present our Fully Informed aNd Efficient (FINE) checkpointing algorithm which can not only improve the performance of Fully Informed (FI) CIC protocol proposed by Helary et al. but also decrease the overhead of piggybacked information.