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.
|Number of pages||8|
|State||Published - 1 Dec 1998|
|Event||Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS - Tainan, China|
Duration: 14 Dec 1998 → 16 Dec 1998
|Conference||Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS|
|Period||14/12/98 → 16/12/98|