Decreasing memory overhead in hard real-time garbage collection

DOI10.1007/3-540-45828-X_16MaRDI QIDQ4439577zbMATH OpenFDO

Authors Tobias Ritzau, Peter Fritzson

Publication date 14 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2491/24910213.htm

Mathematics Subject Classification ID

Theory of software (68N99) Computing methodologies and applications (68U99)

Recommendations

• Scheduling of hard real-time garbage collection
• Storage allocation for real-time, embedded systems
• An implementation of scoped memory for real-time Java
• Optimal real-time garbage collection for acyclic pointer structures
• Garbage collection-aware utility accrual scheduling

Cited in

(8)

• Optimal real-time garbage collection for acyclic pointer structures
• Efficient memory management for concurrent programs that use message passing
• Garbage collection-aware utility accrual scheduling
• Constant-time root scanning for deterministic garbage collection
• The space cost of lazy reference counting
• Storage allocation for real-time, embedded systems
• An implementation of scoped memory for real-time Java
• Scheduling of hard real-time garbage collection

Describes a project that uses

Uses Software

• JCOD

This page was built for publication: Decreasing memory overhead in hard real-time garbage collection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4439577)