Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Simple Generational Garbage Collection and Fast Allocation Andrew W. Appel
 

Summary: Simple Generational Garbage Collection and Fast Allocation
Andrew W. Appel
Department of Computer Science
Princeton University
Princeton, NJ 08544
March 1988
revised September 1988
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 col­
lection with fast allocation, suitable for implementation in a Unix environment.
Keywords: garbage collection, dynamic memory allocation

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences