Skip to main navigation Skip to search Skip to main content

Impact on the writing granularity for incremental checkpointing

  • Junyoung Heo
  • , Xuefeng Piao
  • , Sangho Yi
  • , Geunyoung Park
  • , Minkyu Park
  • , Jiman Hong
  • , Yookun Cho
  • Seoul National University
  • Kwangwoon University

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

Abstract

Incremental checkpointing is an cost-efficient fault tolerant technique for long running programs such as genetic algorithms. In this paper, we derive the equations for the writing granularity of incremental checkpointing and find factors associated with the time overhead and disk space for incremental checkpoint. We also verify the applicability of the derived equation and the acceptability of the factors through experiments.

Original languageEnglish
Title of host publicationFuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings
PublisherSpringer Verlag
Pages1154-1157
Number of pages4
ISBN (Print)9783540283317
StatePublished - 2006
Event2nd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2005 - Changsa, China
Duration: 27 Aug 200529 Aug 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3614 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2005
Country/TerritoryChina
CityChangsa
Period27/08/0529/08/05

Fingerprint

Dive into the research topics of 'Impact on the writing granularity for incremental checkpointing'. Together they form a unique fingerprint.

Cite this