FINE: A Fully Informed and Efficient Communication-Induced Checkpointing protocol

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

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 (TDE-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.

Original languageEnglish
Title of host publication3rd International Conference on Systems, ICONS 2008
Pages16-22
Number of pages7
DOIs
StatePublished - 2008
Event3rd International Conference on Systems, ICONS 2008 - Cancun, Mexico
Duration: Apr 13 2008Apr 18 2008

Publication series

Name3rd International Conference on Systems, ICONS 2008

Conference

Conference3rd International Conference on Systems, ICONS 2008
Country/TerritoryMexico
CityCancun
Period4/13/084/18/08

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'FINE: A Fully Informed and Efficient Communication-Induced Checkpointing protocol'. Together they form a unique fingerprint.

Cite this