TY - GEN
T1 - Garbage collection in a causal message logging protocol
AU - Chung, Kwang Sik
AU - Yu, Heon Chang
AU - Park, Seongbin
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33646402891&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33646402891&partnerID=8YFLogxK
U2 - 10.1007/11557654_18
DO - 10.1007/11557654_18
M3 - Conference contribution
AN - SCOPUS:33646402891
SN - 3540290311
SN - 9783540290315
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 123
EP - 132
BT - High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings
T2 - 1st International Conference on High Performance Computing and Communcations, HPCC 2005
Y2 - 21 September 2005 through 23 September 2005
ER -