On the Fully-Informed Communication-Induced Checkpointing Protocol

Authors:
Jichiang Tsai;Jenn-Wei Lin
Affiliations:
National Chung Hsing University;Fu Jen Catholic University Taipei, Taiwan
Venue:
PRDC '05 Proceedings of the 11th Pacific Rim International Symposium on Dependable Computing
Year:
2005

Citing 0
Cited 3

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

Journal of Parallel and Distributed Computing
Checkpointing and rollback recovery in distributed systems: existing solutions, open issues and proposed solutions

ICS'08 Proceedings of the 12th WSEAS international conference on Systems
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

Communication-induced checkpointing (CIC) protocols can be used to prevent the domino effect. The fully-informed (FI) protocol proposed in the literature is known as the best CIC protocol so far. In this paper, we investigate some properties of such a protocol. First, we discover that an enhancement adopted by the FI protocol rarely takes effect in practice. In particular, we prove that such an enhancement is invalid over a tree communication network. Moreover, the size of the control information that the FI protocol piggybacks on application messages can be further reduced on such a type of network. Next, we show how to apply the FI protocol to another improved indexing strategy introduced in the literature. The management of a boolean array in its control information carried on a message must be modified. Finally, we present a simulation study to analyze the properties of the FI protocol.