Low-cost garbage collection for causal message logging

JinHo Ahn, Sung-Gi Min, ChongSun Hwang

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

Abstract

This paper presents two garbage collection schemes for causalmessage logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. The second scheme enables the process to remove a part of log information in its storage if more empty storage space is required after executing the first scheme. It reduces the number of processes to participate in the garbage collection by using the size of the log information of each process. Simulation results show that combining the two schemes significantly reduces the garbage collection overhead compared with the traditional schemes.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages272-281
Number of pages10
Volume2228
ISBN (Print)3540430091, 9783540430094
Publication statusPublished - 2001
Event8th International Conference on High Performance Computing, HiPC 2001 - Hyderabad, India
Duration: 2001 Dec 172001 Dec 20

Publication series

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

Other

Other8th International Conference on High Performance Computing, HiPC 2001
CountryIndia
CityHyderabad
Period01/12/1701/12/20

Fingerprint

Garbage Collection
Costs
Checkpointing
Checkpoint
Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ahn, J., Min, S-G., & Hwang, C. (2001). Low-cost garbage collection for causal message logging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2228, pp. 272-281). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2228). Springer Verlag.

Low-cost garbage collection for causal message logging. / Ahn, JinHo; Min, Sung-Gi; Hwang, ChongSun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2228 Springer Verlag, 2001. p. 272-281 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2228).

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

Ahn, J, Min, S-G & Hwang, C 2001, Low-cost garbage collection for causal message logging. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2228, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2228, Springer Verlag, pp. 272-281, 8th International Conference on High Performance Computing, HiPC 2001, Hyderabad, India, 01/12/17.
Ahn J, Min S-G, Hwang C. Low-cost garbage collection for causal message logging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2228. Springer Verlag. 2001. p. 272-281. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ahn, JinHo ; Min, Sung-Gi ; Hwang, ChongSun. / Low-cost garbage collection for causal message logging. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2228 Springer Verlag, 2001. pp. 272-281 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e631164f58414bce84a29e9934bde9f8,
title = "Low-cost garbage collection for causal message logging",
abstract = "This paper presents two garbage collection schemes for causalmessage logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. The second scheme enables the process to remove a part of log information in its storage if more empty storage space is required after executing the first scheme. It reduces the number of processes to participate in the garbage collection by using the size of the log information of each process. Simulation results show that combining the two schemes significantly reduces the garbage collection overhead compared with the traditional schemes.",
author = "JinHo Ahn and Sung-Gi Min and ChongSun Hwang",
year = "2001",
language = "English",
isbn = "3540430091",
volume = "2228",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "272--281",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Low-cost garbage collection for causal message logging

AU - Ahn, JinHo

AU - Min, Sung-Gi

AU - Hwang, ChongSun

PY - 2001

Y1 - 2001

N2 - This paper presents two garbage collection schemes for causalmessage logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. The second scheme enables the process to remove a part of log information in its storage if more empty storage space is required after executing the first scheme. It reduces the number of processes to participate in the garbage collection by using the size of the log information of each process. Simulation results show that combining the two schemes significantly reduces the garbage collection overhead compared with the traditional schemes.

AB - This paper presents two garbage collection schemes for causalmessage logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. The second scheme enables the process to remove a part of log information in its storage if more empty storage space is required after executing the first scheme. It reduces the number of processes to participate in the garbage collection by using the size of the log information of each process. Simulation results show that combining the two schemes significantly reduces the garbage collection overhead compared with the traditional schemes.

UR - http://www.scopus.com/inward/record.url?scp=84947720496&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947720496&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540430091

SN - 9783540430094

VL - 2228

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

SP - 272

EP - 281

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

PB - Springer Verlag

ER -