Garbage collection for virtual memory computer systems
- 1 November 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (11) , 981-986
- https://doi.org/10.1145/355606.361886
Abstract
In list processing there is typically a growing demand for space during program execution. This paper examines the practical implications of this growth within a virtual memory computer system, proposes two new garbage collection techniques for virtual memory systems, and compares them with traditional methods by discussion and by simulation.Keywords
This publication has 5 references indexed in Scilit:
- A LISP garbage-collector for virtual-memory computer systemsCommunications of the ACM, 1969
- A note on storage fragmentation and program segmentationCommunications of the ACM, 1969
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- A contribution to the development of ALGOLCommunications of the ACM, 1966
- Mapped list structureCommunications of the ACM, 1963