ACM Home Page
Please provide us with feedback. Feedback
Older-first garbage collection in practice: evaluation in a Java Virtual Machine
Full text PdfPdf (1.15 MB)
Source Memory System Performance archive
Proceedings of the 2002 workshop on Memory system performance table of contents
Berlin, Germany
Pages: 25 - 36  
Year of Publication: 2002
Also published in ...
Authors
Darko Stefanović  University of New Mexico, Albuquerque, NM
Matthew Hertz  University of Massachusetts, Amherst, MA
Stephen M. Blackburn  Australian National University, Canberra, ACT, Australia
Kathryn S. McKinley  University of Texas at Austin, Austin, TX
J. Eliot B. Moss  University of Massachusetts, Amherst, MA
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 42,   Citation Count: 13
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/773146.773042
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
4
5
6
7
 
8
9
 
10
 
11
STANDARD PERFORMANCE EVALUATION CORPORATION. SPECjvm98 Documentation, release 1.03 ed., March 1999.
 
12
STANDARD PERFORMANCE EVALUATION CORPORATION. SPECjbb2000 (Java Business Benchmark) Documentation, release 1.01 ed., 2001.
 
13
14
15

CITED BY  13
Collaborative Colleagues:
Darko Stefanović: colleagues
Matthew Hertz: colleagues
Stephen M. Blackburn: colleagues
Kathryn S. McKinley: colleagues
J. Eliot B. Moss: colleagues