A useless checkpoint corresponds to the occurrence of a checkpoint and communication pattern called Z-cycle. A recent result shows that ensuring a computation without Z-cycles is a particular application of a property, namely Virtual Precedence (VP), defined on an interval-based abstraction of a computation. In this paper we first propose a taxonomy of communication-induced checkpointing protocols based on the way they ensure the VP property. Then we derive a sufficient condition ensuring no Z-cycles in a distributed computation. This condition defines a checkpoint and communication pattern, namely suspect Z-cycle, such that if no suspect Z-cycle exists in a distributed computation then no Z-cycle exists. We present finally a communication-induced checkpointing protocol that avoids useless checkpoints by preventing on-the-fly the formation of suspect Z-cycles and discuss its performance with respect to other protocols.
VP-accordant checkpointing protocol preventing useless checkpoints / Baldoni, Roberto; Quaglia, Francesco; Ciciani, Bruno. - STAMPA. - (1998), pp. 61-67. (Intervento presentato al convegno Proceedings of the 1998 IEEE 17th Symposium on Reliable Distributed Systems, SRDS tenutosi a West Lafayette, IN, USA nel 20 October 1998 through 23 October 1998) [10.1109/reldis.1998.740475].
VP-accordant checkpointing protocol preventing useless checkpoints
BALDONI, Roberto;QUAGLIA, Francesco;CICIANI, Bruno
1998
Abstract
A useless checkpoint corresponds to the occurrence of a checkpoint and communication pattern called Z-cycle. A recent result shows that ensuring a computation without Z-cycles is a particular application of a property, namely Virtual Precedence (VP), defined on an interval-based abstraction of a computation. In this paper we first propose a taxonomy of communication-induced checkpointing protocols based on the way they ensure the VP property. Then we derive a sufficient condition ensuring no Z-cycles in a distributed computation. This condition defines a checkpoint and communication pattern, namely suspect Z-cycle, such that if no suspect Z-cycle exists in a distributed computation then no Z-cycle exists. We present finally a communication-induced checkpointing protocol that avoids useless checkpoints by preventing on-the-fly the formation of suspect Z-cycles and discuss its performance with respect to other protocols.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.