Older-first garbage collection in practice: evaluation in a Java Virtual Machine

  • Authors:

  • Darko Stefanović;Matthew Hertz;Stephen M. Blackburn;Kathryn S. McKinley;J. Eliot B. Moss

  • Affiliations:

  • University of New Mexico, Albuquerque, NM;University of Massachusetts, Amherst, MA;Australian National University, Canberra, ACT, Australia;University of Texas at Austin, Austin, TX;University of Massachusetts, Amherst, MA

  • Venue:
  • Proceedings of the 2002 workshop on Memory system performance
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.