An efficient machine-independent procedure for garbage collection in various list structures
- 1 August 1967
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 10 (8) , 501-506
- https://doi.org/10.1145/363534.363554
Abstract
A method for returning registers to the free list is an essential part of any list processing system. In this paper, past solutions of the recovery problem are reviewed and compared. A new algorithm is presented which offers significant advantages of speed and storage utilization. The routine for implementing this algorithm can be written in the list language with which it is to be used, thus insuring a degree of machine independence. Finally, the application of the algorithm to a number of different list structures appearing in the literature is indicated.Keywords
This publication has 11 references indexed in Scilit:
- A note on the formation of free listCommunications of the ACM, 1964
- Multiword list itemsCommunications of the ACM, 1964
- Lists and why they are usefulPublished by Association for Computing Machinery (ACM) ,1964
- An Experiment with a Self-compiling Compiler for a Simple List-processing LanguagePublished by Elsevier ,1964
- Symmetric list processorCommunications of the ACM, 1963
- Knotted list structuresCommunications of the ACM, 1962
- The use of threaded lists in constructing a combined ALGOL and machine-like assembly processorCommunications of the ACM, 1961
- A method for overlapping and erasure of listsCommunications of the ACM, 1960
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960
- A Fortran-Compiled List-Processing LanguageJournal of the ACM, 1960