Efficient incremental algorithm for identifying consistent checkpoints

Loon Been Chen*, I-Chen Wu

*此作品的通信作者

研究成果: Paper同行評審

摘要

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(p2M) time in total, where p is the number of processes and M is the number of checkpoints.

原文English
頁面122-129
頁數8
DOIs
出版狀態Published - 1998
事件Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS - Tainan, China
持續時間: 14 12月 199816 12月 1998

Conference

ConferenceProceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS
城市Tainan, China
期間14/12/9816/12/98

指紋

深入研究「Efficient incremental algorithm for identifying consistent checkpoints」主題。共同形成了獨特的指紋。

引用此