Reference count garbage collection
Author:
- 1 June 1984
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 14 (6) , 503-507
Abstract
A garbage collection algorithm that permits a reference count storage reclamation scheme to collect circularly linked inaccessible structures is presented. The algorithm requires no additional information beyond that required by a reference count scheme. In particular, it does not require the garbage collector to be able to find pointers outside the heap. The algorithm is most useful for augmenting reference count storage reclamation systems and for implementing storage management systems on top of languages that do not provide their own. It is, however, considerably less efficient in space and time than conventional garbage collection systems.Keywords
This publication has 7 references indexed in Scilit:
- Garbage Collection of Linked Data StructuresACM Computing Surveys, 1981
- List processing in real time on a serial computerCommunications of the ACM, 1978
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970
- A LISP garbage-collector for virtual-memory computer systemsCommunications of the ACM, 1969
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967
- Symmetric list processorCommunications of the ACM, 1963
- A method for overlapping and erasure of listsCommunications of the ACM, 1960