An Efficient Incremental Algorithm for Identifying Consistent Checkpoints

ICPADS（1998）

引用 0|浏览1

暂无评分

摘要

In a distributed system, identifying consistent checkpoints is essential for error recovery and debugging. In this paper, we design an efficient incremental algorithm capable of identifying all the consistent and removable checkpoints each time a new checkpoint is reported. By doing so, the required memory space can be minimized by removing those removables. While minimizing the memory space, the algorithm requires only O(p^2 M) time in total, where p is the number of processes and M is the number of checkpoints.

查看译文

关键词

error recovery,removable checkpoint,identifying consistent checkpoints,required memory space,memory space,efficient incremental algorithm,new checkpoint,consistent checkpoint,algorithm design and analysis,computational complexity,debugging,distributed algorithms,distributed system

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要