IEEE transactions on parallel and distributed systems, 1995-05, Vol.6 (5), p.546-554
1995
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Checkpoint space reclamation for uncoordinated checkpointing in message-passing systems
- Ist Teil von
- IEEE transactions on parallel and distributed systems, 1995-05, Vol.6 (5), p.546-554
- Ort / Verlag
- Los Alamitos, CA: IEEE
- Erscheinungsjahr
- 1995
- Quelle
- IEEE Electronic Library (IEL)
- Beschreibungen/Notizen
- Uncoordinated checkpointing allows process autonomy and general nondeterministic execution, but suffers from potential domino effects and the associated space overhead. Previous to this research, checkpoint space reclamation had been based on the notion of obsolete checkpoints; as a result, a potentially unbounded number of nonobsolete checkpoints may have to be retained on stable storage. In this paper, we derive a necessary and sufficient condition for identifying all garbage checkpoints. By using the approach of recovery line transformation and decomposition, we develop an optimal checkpoint space reclamation algorithm and show that the space overhead for uncoordinated checkpointing is in fact bounded by N(N+1)/2 checkpoints where N is the number of processes.< >
- Sprache
- Englisch
- Identifikatoren
- ISSN: 1045-9219eISSN: 1558-2183DOI: 10.1109/71.382324Titel-ID: cdi_ieee_primary_382324
- Format
- –
- Schlagworte
- Applied sciences, Checkpointing, Computer science, control theory, systems, Computer systems and distributed systems. User interface, Exact sciences and technology, Hardware, Laboratories, Mathematics, Military computing, NASA, Protocols, Runtime, Software, Software systems, Sufficient conditions