Consistency issues in distributed checkpoints

Citation
Jm. Helary et al., Consistency issues in distributed checkpoints, IEEE SOFT E, 25(2), 1999, pp. 274-281
Citations number
19
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
ISSN journal
00985589 → ACNP
Volume
25
Issue
2
Year of publication
1999
Pages
274 - 281
Database
ISI
SICI code
0098-5589(199903/04)25:2<274:CIIDC>2.0.ZU;2-R
Abstract
A global checkpoint is a set of local checkpoints, one per process. The tra ditional consistency criterion for global checkpoints states that a global checkpoint is consistent if it does not include messages received and not s ent. This paper investigates other consistency criteria, transitlessness, a nd strong consistency. A global checkpoint is transitless if it does not ex hibit messages sent and nor received. Transitlessness can be seen as a dual of traditional consistency. Strong consistency is the addition of transitl essness to traditional consistency. The main result of this paper is a stat ement of the necessary and sufficient condition answering the following que stion: "Given an arbitrary set of local checkpoints, can this set be extend ed to a global checkpoint that satisfies P-m (where LP is traditional consi stency, transitlessness, or strong consistency). From a practical point of view, this condition, when applied to transitlessness, is particularly inte resting as it helps characterize which messages do not need to be recorded by checkpointing protocols.