Simple Generational Garbage Collection and Fast Allocation

Simple Generational Garbage Collection and Fast Allocation (1988)

by Andrew W. Appel

Citations:

170 - 7 self

User correction supplied by mph

Datum	Value	Source
TITLE	Simple Generational Garbage Collection and Fast Allocation	SVM HeaderParse 0.1
AUTHOR NAME	Andrew W. Appel	user correction
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.	user correction
YEAR	1988	user correction
CITATIONS	12 found	ParsCit 1.0