AN EFFICIENT MERGING ALGORITHM FOR RECOVERY AND GARBAGE COLLECTION IN INCREMENTAL CHECKPOINTING

摘要

Incremental checkpointing saves only the modified pages of the checkpoint using page write-protection. While on the one hand, the checkpointing overhead is decreased when incremental checkpointing is used, old checkpoints cannot be merged and deleted because the process' memory pages become spread out over many incremental checkpoints. In this paper, we present an efficient merging algorithm for the recovery and garbage collection in incremental checkpointing. The proposed algorithm can merge several incremental checkpoints into a full checkpoint for recovery and can delete unnecessary incremental checkpoints.