An efficient incremental algorithm for identifying consistent checkpoints

In a distributed system, identifying consistent checkpoints is essential for error recovery and debugging. 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 c...

Full description

Saved in:
Bibliographic Details
Published inProceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) pp. 122 - 129
Main Authors Loon-Been Chen, I-Chen Wu
Format Conference Proceeding
LanguageEnglish
Published IEEE 1998
Subjects
Algorithm design and analysis
Debugging
Online AccessGet full text

Cover

More Information
Summary:In a distributed system, identifying consistent checkpoints is essential for error recovery and debugging. 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/sup 2/M) time in total, where p is the number of processes and M is the number of checkpoints.
ISBN:0818686030
9780818686030
ISSN:1521-9097
2690-5965
DOI:10.1109/ICPADS.1998.741028