Efficient garbage collection schemes for causal message logging with independent checkpointing

J. Ahn, Sung-Gi Min, C. S. Hwang, Heonchang Yu

Research output: Contribution to journalArticle

Abstract

This paper presents three garbage collection schemes for causal message logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its volatile storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. Additionally, it supports faster output commit than traditional schemes. The second scheme enables each process to remove a part of log information in the storage if more empty space is required. It reduces the number of processes participating in the garbage collection by using the size of the log information of each process. The third scheme is a hybrid scheme having the advantages of the two proposed schemes. Simulation results show that the third scheme significantly reduces the garbage collection overhead compared with the traditional schemes regardless of specific communication patterns of distributed applications.

Original languageEnglish
Pages (from-to)175-196
Number of pages22
JournalJournal of Supercomputing
Volume22
Issue number2
DOIs
Publication statusPublished - 2002 Jun 1

Fingerprint

Garbage Collection
Checkpointing
Communication
Checkpoint
Volatiles
Distributed Applications

Keywords

  • Checkpointing
  • Fault-tolerance
  • Garbage collection
  • Message logging
  • Message passing systems

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Efficient garbage collection schemes for causal message logging with independent checkpointing. / Ahn, J.; Min, Sung-Gi; Hwang, C. S.; Yu, Heonchang.

In: Journal of Supercomputing, Vol. 22, No. 2, 01.06.2002, p. 175-196.

Research output: Contribution to journalArticle

@article{e5a98f832dd14fedb00a380e9c6dc2f7,
title = "Efficient garbage collection schemes for causal message logging with independent checkpointing",
abstract = "This paper presents three garbage collection schemes for causal message logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its volatile storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. Additionally, it supports faster output commit than traditional schemes. The second scheme enables each process to remove a part of log information in the storage if more empty space is required. It reduces the number of processes participating in the garbage collection by using the size of the log information of each process. The third scheme is a hybrid scheme having the advantages of the two proposed schemes. Simulation results show that the third scheme significantly reduces the garbage collection overhead compared with the traditional schemes regardless of specific communication patterns of distributed applications.",
keywords = "Checkpointing, Fault-tolerance, Garbage collection, Message logging, Message passing systems",
author = "J. Ahn and Sung-Gi Min and Hwang, {C. S.} and Heonchang Yu",
year = "2002",
month = "6",
day = "1",
doi = "10.1023/A:1014978702504",
language = "English",
volume = "22",
pages = "175--196",
journal = "The Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Efficient garbage collection schemes for causal message logging with independent checkpointing

AU - Ahn, J.

AU - Min, Sung-Gi

AU - Hwang, C. S.

AU - Yu, Heonchang

PY - 2002/6/1

Y1 - 2002/6/1

N2 - This paper presents three garbage collection schemes for causal message logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its volatile storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. Additionally, it supports faster output commit than traditional schemes. The second scheme enables each process to remove a part of log information in the storage if more empty space is required. It reduces the number of processes participating in the garbage collection by using the size of the log information of each process. The third scheme is a hybrid scheme having the advantages of the two proposed schemes. Simulation results show that the third scheme significantly reduces the garbage collection overhead compared with the traditional schemes regardless of specific communication patterns of distributed applications.

AB - This paper presents three garbage collection schemes for causal message logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its volatile storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. Additionally, it supports faster output commit than traditional schemes. The second scheme enables each process to remove a part of log information in the storage if more empty space is required. It reduces the number of processes participating in the garbage collection by using the size of the log information of each process. The third scheme is a hybrid scheme having the advantages of the two proposed schemes. Simulation results show that the third scheme significantly reduces the garbage collection overhead compared with the traditional schemes regardless of specific communication patterns of distributed applications.

KW - Checkpointing

KW - Fault-tolerance

KW - Garbage collection

KW - Message logging

KW - Message passing systems

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

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

U2 - 10.1023/A:1014978702504

DO - 10.1023/A:1014978702504

M3 - Article

AN - SCOPUS:0036605228

VL - 22

SP - 175

EP - 196

JO - The Journal of Supercomputing

JF - The Journal of Supercomputing

SN - 0920-8542

IS - 2

ER -