By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yi Luo ; Dept. of Comput. Sci., Kentucky Univ., Lexington, KY ; D. Manivannan

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 (TDE_TSS) mechanism by which we can both timestamp each event and get the transitive dependency information upon receiving a message. Finally, based on this times- tamping 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.

Published in:

Systems, 2008. ICONS 08. Third International Conference on

Date of Conference:

13-18 April 2008