Older-first Garbage Collection in Practice: Evaluation in a Java Virtual Machine

Older-first Garbage Collection in Practice: Evaluation in a Java Virtual Machine (2002)

Cached

Download Links

by Darko Stefanovic , Matthew Hertz , Stephen M. Blackburn , Kathryn S. McKinley , J. Eliot B. Moss

Citations:

20 - 6 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Older-first Garbage Collection in Practice: Evaluation in a Java Virtual Machine	user correction - Legacy Corrections
AUTHOR NAME	Darko Stefanovic	user correction
AUTHOR NAME	Matthew Hertz	user correction
AUTHOR NAME	Stephen M. Blackburn	user correction
AUTHOR AFFIL	Dept. of Computer Science; University of Massachusetts	user correction
AUTHOR ADDR	Amherst, MA 01003	user correction
AUTHOR NAME	Kathryn S. McKinley	user correction
AUTHOR AFFIL	Dept. of Computer Science; University of Massachusetts	user correction
AUTHOR ADDR	Amherst, MA 01003	user correction
AUTHOR NAME	J. Eliot B. Moss	user correction
AUTHOR AFFIL	Dept. of Computer Science; University of Massachusetts	user correction
AUTHOR ADDR	Amherst, MA 01003	user correction
ABSTRACT	Until recently, the best performing copying garbage collectors used a generational policy which repeatedly collects the very youngest objects, copies any survivors to an older space, and then infrequently collects the older space. A previous study that used garbage collection simulation pointed to potential improvements by using an Older-First copying garbage collection algorithm. The Older-First algorithm sweeps a fixed-sized window through the heap from older to younger objects, and avoids copying the very youngest objects which have not yet had sufficient time to die. We describe and examine here an implementation of the Older-First algorithm in the Jikes RVM for Java. This investigation shows that Older-First can perform as well as the simulation results suggested, and greatly improves total program performance when compared to using a fixed-size nursery generational collector. We further compare Older-First to a flexible-size nursery generational collector in which the nursery occupies all of the heap that does not contain older objects. In these comparisons, the flexible-nursery collector is occasionally the better of the two, but on average the Older-First collector performs the best.	user correction - Legacy Corrections
YEAR	2002	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0