Garbage Collection in a Causal Message Logging Protocol
This paper presents a garbage collection protocol for message content logs and message determinant logs which are saved on a stable storage. Previous works of garbage collections in a causal message logging protocol try to solve the garbage collection of message determinant log and force additional...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper presents a garbage collection protocol for message content logs and message determinant logs which are saved on a stable storage. Previous works of garbage collections in a causal message logging protocol try to solve the garbage collection of message determinant log and force additional checkpoints[5,6,7]. In order to avoid the sympathetic rollback, we classify the fault tolerance information into message determinants logs and message contents logs. Then we propose new definitions for garbage collections conditions for message determinant logs and message content logs and present a garbage collection algorithm. To represent determinants of messages, a data structure called MAG (Modified Antecedence Graph) is proposed. MAG is an extension of Antecedence Graph of Manetho system [7] and it is used for garbage collections conditions of message determinant logs and message content logs. Unlike Manetho system that needs additional messages for garbage collection of message content logs, our algorithm does not need additional messages. The proposed garbage collection algorithm makes ’the lazy garbage collection effect’ because it relies on the piggybacked checkpoint information in send/receive message. ‘The lazy garbage collection effect’ provides the whole system with an efficient and simple recovery protocol. |
---|---|
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/11557654_18 |