Low-Cost Garbage Collection for Causal Message Logging

Authors:
JinHo Ahn;Sung-Gi Min;Chong-Sun Hwang
Affiliations:
-;-;-
Venue:
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Year:
2001

Citing 3
Cited 0

Paradigms for process interaction in distributed programs

ACM Computing Surveys (CSUR)
Manetho: Transparent Roll Back-Recovery with Low Overhead, Limited Rollback, and Fast Output Commit

IEEE Transactions on Computers - Special issue on fault-tolerant computing
Parsec: A Parallel Simulation Environment for Complex Systems

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents two garbage collection schemes for causal message 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.