Ulterior Reference Counting: Fast Garbage Collection without a Long Wait

Ulterior Reference Counting: Fast Garbage Collection without a Long Wait (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Stephen M Blackburn , Kathryn S McKinley

Venue:	IN OOPSLA 2003 ACM CONFERENCE ON OBJECT-ORIENTED PROGRAMMING, SYSTEMS, LANGUAGES AND APPLICATIONS
Citations:	31 - 7 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Ulterior Reference Counting: Fast Garbage Collection without a Long Wait	user correction
AUTHOR NAME	Stephen M Blackburn	user correction
AUTHOR AFFIL	Department of Computer Science; Australian National University	user correction
AUTHOR ADDR	Canberra, ACT, 0200, Australia	user correction
AUTHOR NAME	Kathryn S McKinley	user correction
AUTHOR AFFIL	Department of Computer Sciences; University of Texas at Austin; Categories and Subject Descriptors	user correction
AUTHOR ADDR	Austin, TX, 78712, USA	user correction
ABSTRACT	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 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 marksweep, 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.	SVM HeaderParse 0.1
YEAR	2003	INFERENCE
VENUE	IN OOPSLA 2003 ACM CONFERENCE ON OBJECT-ORIENTED PROGRAMMING, SYSTEMS, LANGUAGES AND APPLICATIONS	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	344--358	INFERENCE
CITATIONS	31 found	ParsCit 1.0