Referenced Items are not available for this document.
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(p2M) time in total, where p is the number of processes and M is the number of checkpoints
Published in:
Parallel and Distributed Systems, 1998. Proceedings. 1998 International Conference on
Date of Conference: 14-16 Dec 1998
- Page(s):
- 122 - 129
- Meeting Date :
- 14 Dec 1998-16 Dec 1998
- ISSN :
- 1521-9097
- Print ISBN:
- 0-8186-8603-0
- INSPEC Accession Number:
- 6135727
- Conference Location :
- Tainan
- Digital Object Identifier :
- 10.1109/ICPADS.1998.741028
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
