Garbage collection in a causal message logging protocol

Kwang Sik Chung, Heonchang Yu, Seongbin Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages123-132
Number of pages10
Volume3726 LNCS
DOIs
Publication statusPublished - 2005 Dec 1
Event1st International Conference on High Performance Computing and Communcations, HPCC 2005 - Sorrento, Italy
Duration: 2005 Sep 212005 Sep 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3726 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st International Conference on High Performance Computing and Communcations, HPCC 2005
CountryItaly
CitySorrento
Period05/9/2105/9/23

Fingerprint

Garbage
Garbage Collection
Determinant
Fault tolerance
Data structures
Checkpoint
Recovery
Graph in graph theory
Fault Tolerance
Data Structures
Classify

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chung, K. S., Yu, H., & Park, S. (2005). Garbage collection in a causal message logging protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3726 LNCS, pp. 123-132). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3726 LNCS). https://doi.org/10.1007/11557654_18

Garbage collection in a causal message logging protocol. / Chung, Kwang Sik; Yu, Heonchang; Park, Seongbin.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3726 LNCS 2005. p. 123-132 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3726 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chung, KS, Yu, H & Park, S 2005, Garbage collection in a causal message logging protocol. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3726 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3726 LNCS, pp. 123-132, 1st International Conference on High Performance Computing and Communcations, HPCC 2005, Sorrento, Italy, 05/9/21. https://doi.org/10.1007/11557654_18
Chung KS, Yu H, Park S. Garbage collection in a causal message logging protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3726 LNCS. 2005. p. 123-132. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11557654_18
Chung, Kwang Sik ; Yu, Heonchang ; Park, Seongbin. / Garbage collection in a causal message logging protocol. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3726 LNCS 2005. pp. 123-132 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{215d8d2691bf48efaf2a471ca0cb2804,
title = "Garbage collection in a causal message logging protocol",
abstract = "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.",
author = "Chung, {Kwang Sik} and Heonchang Yu and Seongbin Park",
year = "2005",
month = "12",
day = "1",
doi = "10.1007/11557654_18",
language = "English",
isbn = "3540290311",
volume = "3726 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "123--132",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Garbage collection in a causal message logging protocol

AU - Chung, Kwang Sik

AU - Yu, Heonchang

AU - Park, Seongbin

PY - 2005/12/1

Y1 - 2005/12/1

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

VL - 3726 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 123

EP - 132

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -