Guaranteeing non-disruptiveness and real-time deadlines in an incremental garbage collector

Authors:
Fridtjof Siebert
Affiliations:
The Open Group Research Institute, 2, Avenue de Vignate, 38610 Gières, France
Venue:
Proceedings of the 1st international symposium on Memory management
Year:
1998

Citing 5
Cited 8

Eiffel: the language

Eiffel: the language
The Java programming language (2nd ed.)

The Java programming language (2nd ed.)
List processing in real time on a serial computer

Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM
Uniprocessor Garbage Collection Techniques

IWMM '92 Proceedings of the International Workshop 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
Decreasing Memory Overhead in Hard Real-Time Garbage Collection

EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Constant-Time Root Scanning for Deterministic Garbage Collection

CC '01 Proceedings of the 10th International Conference on Compiler Construction
Low memory overhead real-time garbage collection for Java

JTRES '06 Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems
Deterministic execution of java's primitive bytecode operations

JVM'01 Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1
Realtime garbage collection in the JamaicaVM 3.0

JTRES '07 Proceedings of the 5th international workshop on Java technologies for real-time and embedded systems
Mark-sweep or copying?: a "best of both worlds" algorithm and a hardware-supported real-time implementation

Proceedings of the 6th international symposium on Memory management
Joint garbage collection and hard real-time scheduling

Journal of Embedded Computing - Best Papers of RTS' 2005

Quantified Score

Hi-index	0.00

Visualization

Abstract

For Garbage Collection (GC) to be a generally accepted means of memory management it is required to prove its efficiency. This paper presents a scheme that guarantees that an incremental Garbage Collector will have completed its collection cycle before the system runs out of memory. Furthermore, it is shown that the work that has to be done by the collector in one incremental step is limited by a small constant depending on the percentage of total memory used by the application program. This result then allows a suitable trade-off between memory demand and GC overhead to be found.