the overhead model of word-level and page-level incremental checkpointing
Generally, word-level granularity for incremental checkpointing may reduce the checkpoint file size, and hence get better the performance. However, word-level granularity may not always be more efficient than page-level granularity, because word-level granularity may sometimes increase the checkpointing overhead for finding the differences between two checkpoints and for writing the address of the modified word to stable storage. In this paper, we make the overhead model and find factors which produce an effect on the over-head. We also show that the model and the factors are fairly reasonable via experimental results from Linux Kernel-level incremental checkpointing facility.
word-level page-level incremental checkpointing fault tolerance checkpoint and recovery