Optimal real-time garbage collection for acyclic pointer structures

doi:10.1016/S0020-0190(00)00212-X

Information Processing Letters

Volume 77, Issues 2–4, 28 February 2001, Pages 151-157

https://doi.org/10.1016/S0020-0190(00)00212-X Get rights and content

Abstract

A real-time garbage collector for acyclic pointer structures is derived. Operations on the structure, such as assignment, allocation and de-allocation, take worst-case constant time. With respect to this real-time behaviour, storage usage is minimal. A complete implementation is presented.

References (4)

L.P. Deutsch et al.
An efficient incremental automatic garbage collector
Comm. ACM
(1976)
E.W. Dijkstra
A Discipline of Programming
(1976)

There are more references available in the full text version of this article.

Cited by (4)

Optimal tenuring and major collection times for a generational garbage collector
2012, Asia-Pacific Journal of Operational Research
Generational garbage collection policies
2013, Springer Series in Reliability Engineering
Two generational garbage collection models with major collection time
2011, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Optimal replacement policy for continuous to garbage collection
2011, ICQR2MSE 2011 - Proceedings of 2011 International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering

View full text

Optimal real-time garbage collection for acyclic pointer structures

Abstract

An efficient incremental automatic garbage collector

Comm. ACM

A Discipline of Programming