Skip navigation
Skip navigation

Ulterior Reference Counting: Fast Garbage Collection without a Long Wait

Blackburn, Stephen; McKinley, Kathryn

Description

General purpose garbage collectors have yet to combine short pause times with high throughput. For example, generational collectors can achieve high throughput. They have modest average pause times, but occasionally collect the whole heap and consequently incur long pauses. At the other extreme, concurrent collectors, including reference counting, attain short pause times but with significant performance penalties. This paper introduces a new hybrid collector that combines copying generational...[Show more]

dc.contributor.authorBlackburn, Stephen
dc.contributor.authorMcKinley, Kathryn
dc.coverage.spatialAnaheim USA
dc.date.accessioned2015-12-13T23:12:08Z
dc.date.available2015-12-13T23:12:08Z
dc.date.createdOctober 26 2003
dc.identifier.isbn0362-1340
dc.identifier.urihttp://hdl.handle.net/1885/87908
dc.description.abstractGeneral purpose garbage collectors have yet to combine short pause times with high throughput. For example, generational collectors can achieve high throughput. They have modest average pause times, but occasionally collect the whole heap and consequently incur long pauses. At the other extreme, concurrent collectors, including reference counting, attain short pause times but with significant performance penalties. This paper introduces a new hybrid collector that combines copying generational collection for the young objects and reference counting the old objects to achieve both goals. It restricts copying and reference counting to the object demographics for which they perform well. Key to our algorithm is a generalization of deferred reference counting we call Ulterior Reference Counting. Ulterior reference counting safely ignores mutations to select heap objects. We compare a generational reference counting hybrid with pure reference counting, pure mark-sweep, and hybrid generational mark-sweep collectors. This new collector combines excellent throughput, matching a high performance generational mark-sweep hybrid, with low maximum pause times.
dc.publisherAssociation for Computing Machinery Inc (ACM)
dc.relation.ispartofseriesACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA 2003)
dc.sourceConference on Object Oriented Programming Systems Languages and Applications Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programming languages, and applications
dc.source.urihttp://www.oopsla.org/
dc.source.urihttp://portal.acm.org/citation.cfm?id=949336&coll=portal&dl=ACM&CFID=18364594&CFTOKEN=39368195
dc.subjectKeywords: Algorithms; Boolean functions; Cache memory; Data structures; Java programming language; Metadata; Program compilers; Garbage collection; Generational hybrid; Memory management; Ulterior reference counting; Storage allocation (computer) Copying; Generational hybrid; Java; Reference counting; Ulterior reference counting
dc.titleUlterior Reference Counting: Fast Garbage Collection without a Long Wait
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2003
local.identifier.absfor080308 - Programming Languages
local.identifier.absfor080499 - Data Format not elsewhere classified
local.identifier.ariespublicationMigratedxPub17393
local.type.statusPublished Version
local.contributor.affiliationBlackburn, Stephen, College of Engineering and Computer Science, ANU
local.contributor.affiliationMcKinley, Kathryn, University of Texas
local.bibliographicCitation.startpage344
local.bibliographicCitation.lastpage358
dc.date.updated2015-12-12T08:30:27Z
local.identifier.scopusID2-s2.0-1442264006
CollectionsANU Research Publications

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator