Impact on the Writing Granularity for Incremental Checkpointing

摘要

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.