University of York, Department of Computer Science
Real-Time Systems Research Group
News
Local info
The Group
Projects
Publications
Other

Hard Real-time Hybrid Garbage Collection with Low Memory Requirement

Y. Chang

University of York
2006

Abstract

Current real-time garbage collection algorithms are usually criticised for their high memory requirements. Even when consuming nearly 50% of cpu time, some garbage collectors ask for at least twice the memory as really needed. This report explores the fundamental reason of this problem and proposes new metrics for real-time garbage collection algorithm designs. Use of these metrics motivate an algorithm that combines both reference counting and mark-and-sweep techniques. The use of dual priority scheduling of the garbage collection task allows spare capacity in the system to be reclaimed whilst guaranteeing deadlines.

Download

R:Chang:2006b.pdf

Bibtex

@techreport{R:Chang:2006b,
author = {Y. Chang},
title = {Hard Real-time Hybrid Garbage Collection with Low Memory Requirement},
institution = {University of York},
year = {2006},
type = {techreport},
abstract = {Current real-time garbage collection algorithms are usually criticised for their high memory requirements. Even when consuming nearly 50\% of cpu time, some garbage collectors ask for at least twice the memory as really needed. This report explores the fundamental reason of this problem and proposes new metrics for real-time garbage collection algorithm designs. Use of these metrics motivate an algorithm that combines both reference counting and mark-and-sweep techniques. The use of dual priority scheduling of the garbage collection task allows spare capacity in the system to be reclaimed whilst guaranteeing deadlines.},
}

[top]