Show simple item record

dc.contributor.authorLieberman, Henryen_US
dc.contributor.authorHewitt, Carlen_US
dc.date.accessioned2004-10-04T14:52:05Z
dc.date.available2004-10-04T14:52:05Z
dc.date.issued1981-10-01en_US
dc.identifier.otherAIM-569aen_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6335
dc.description.abstractIn 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's 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 which: Makes storage for short-lived objects cheaper than storage for long-lived objects. Operates in real time ??ject creation and access times are bounded. Increases locality of reference, for better virtual memory performance. Works well with multiple processors and a large address space.en_US
dc.format.extent38 p.en_US
dc.format.extent14889429 bytes
dc.format.extent10856966 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-569aen_US
dc.titleA Real Time Garbage Collector Based on the Lifetimes of Objectsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record