Efficient incremental algorithm for identifying consistent checkpoints

Loon Been Chen*, I-Chen Wu

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages122-129
Number of pages8
DOIs
StatePublished - 1 Dec 1998
EventProceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS - Tainan, China
Duration: 14 Dec 199816 Dec 1998

Conference

ConferenceProceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS
CityTainan, China
Period14/12/9816/12/98

Fingerprint Dive into the research topics of 'Efficient incremental algorithm for identifying consistent checkpoints'. Together they form a unique fingerprint.

Cite this