Chang, Y. and Wellings, A. (2006) Hard Real-Time Hybrid Garbage Collection with Low memory Requirements. In: Proceedings of the 27th IEEE Real-Time Systems Symposium. RTSS'06. IEEE , pp. 77-86.
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 paper explores the fundamental reason for this problem and proposes a new performance indicator for the evaluation of real-time garbage collection algorithms. Use of this performance indicator motivates an algorithm that combines both reference counting and mark-and-sweep techniques. In the presence of our collector, a garbage collected hard real-time system can achieve the correct balance of time-space tradeoff with less effort. In order to provide both temporal and spatial guarantees needed by a hard real-time application, an offline analysis is developed and integrated into the current response time analysis framework. Moreover, the use of dual priority scheduling of the garbage collection tasks allows spare capacity in the system to be reclaimed whilst guaranteeing deadlines.
|Institution:||The University of York|
|Academic Units:||The University of York > Computer Science (York)|
|Depositing User:||York RAE Import|
|Date Deposited:||07 Apr 2009 09:48|
|Last Modified:||07 Apr 2009 09:48|