Guaranteeing non-disruptiveness and real-time deadlines in an incremental garbage collector
Proceedings of the 1st international symposium on Memory management
Eliminating external fragmentation in a non-moving garbage collector for Java
CASES '00 Proceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
The Real-Time Specification for Java
The Real-Time Specification for Java
Joint scheduling of garbage collector and hard real-time tasks for embedded applications
Journal of Systems and Software
A real-time garbage collector with low overhead and consistent utilization
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent Cycle Collection in Reference Counted Systems
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
The Design and Performance of the jRate Real-Time Java Implementation
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Time-triggered garbage collection: robust and adaptive real-time GC scheduling for embedded systems
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Real-Time Memory Management: Life and Times
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Hi-index | 0.00 |
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 better design of real-time garbage collection algorithms. Use of this indicator motivates an algorithm that combines both reference counting and mark-and-sweep techniques. The implementation of this algorithm for jRate is described and its performance reviewed. The use of dual priority scheduling of the garbage collection tasks allows spare capacity in the system to be reclaimed whilst guaranteeing deadlines.