Constant-time root scanning for deterministic garbage collection

DOI10.1007/3-540-45306-7_21MaRDI QIDQ2764087zbMATH OpenFDO

Authors Fridtjof Siebert

Publication date 22 January 2002

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/2027/20270304

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Scheduling of hard real-time garbage collection
• scientific article; zbMATH DE number 1332627
• Optimal real-time garbage collection for acyclic pointer structures
• Decreasing memory overhead in hard real-time garbage collection
• scientific article; zbMATH DE number 42971

Cited in

(1)

• Schedulable garbage collection in CLI virtual execution system

This page was built for publication: Constant-time root scanning for deterministic garbage collection

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