Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A real-time garbage collector based on the lifetimes of objects

A real-time garbage collector based on the lifetimes of objects In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it is worth optimizing a garbage collector to reclaim storage for these objects more quickly. The garbage collector should spend proportionately less effort reclaiming objects with longer lifetimes. We present a garbage collection algorithm that (1) makes storage for short-lived objects cheaper than storage for long-lived objects, (2) that operates in real time—object creation and access times are bounded, (3) increases locality of reference, for better virtual memory performance, (4) works well with multiple processors and a large address space. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

A real-time garbage collector based on the lifetimes of objects

Communications of the ACM , Volume 26 (6) – Jun 1, 1983

Loading next page...
 
/lp/association-for-computing-machinery/a-real-time-garbage-collector-based-on-the-lifetimes-of-objects-RuqE5LzCeW

References (34)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1983 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/358141.358147
Publisher site
See Article on Publisher Site

Abstract

In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it is worth optimizing a garbage collector to reclaim storage for these objects more quickly. The garbage collector should spend proportionately less effort reclaiming objects with longer lifetimes. We present a garbage collection algorithm that (1) makes storage for short-lived objects cheaper than storage for long-lived objects, (2) that operates in real time—object creation and access times are bounded, (3) increases locality of reference, for better virtual memory performance, (4) works well with multiple processors and a large address space.

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Jun 1, 1983

There are no references for this article.