Abstract

Generational garbage collection algorithms achieve efficiency because newer records point to older records; the only way an older record can point to a newer record is by a store operation to a previously-created record, and such operations are rare in many languages. A garbage collector that concentrates just on recently allocated records can take advantage of this fact. Such a garbage collector can be so efficient that the allocation of records costs more than their disposal. A scheme for quick record allocation attacks this bottleneck. Many garbage-collected environments don't know when to ask the operating system for more memory. A robust heuristic solves this problem. This paper presents a simple, efficient, low-overhead version of generational garbage collection with fast allocation, suitable for implementation in a Unix environment.

Citations

316	Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm - Ungar - 1984
301	Recursive functions of symbolic expressions and their computation by machine, part I - McCarthy - 1960
234	A Real-Time Garbage Collector Based on the Lifetime of Objects - Lieberman, Hewitt - 1983
215	A nonrecursive list compacting algorithm - Cheney - 1970
136	Garbage collection in a large LISP system - Moon - 1984
103	Garbage collection can be faster than stack allocation - Appel - 1987
89	A Standard ML compiler - Appel, MacQueen - 1987
85	Real-time concurrent collection on stock multiprocessors - Appel
76	Yochelson: A LISP garbage-collector for virtual-memory computer systems - Fenichel, J - 1969
61	Runtime tags aren't necessary - Appel - 1989
16	Heap storage management for the programming language Pascal - Britton - 1975
11	A Micro-Kernel for Concurrency in - CORMACK - 1988