Error-Free Garbage Collection Traces: How to Cheat and Not Get Caught (2002)
Cached
Download Links
- [www-ali.cs.umass.edu]
- [cs.anu.edu.au]
- [www.cs.umass.edu]
- [cs.anu.edu.au]
- [parapet.ee.princeton.edu]
- [www.cs.umass.edu]
- [www.cs.unm.edu]
- [cs.anu.edu.au]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SYSTEMS (SIGMETRICS 2002 |
| Citations: | 21 - 5 self |
BibTeX
@INPROCEEDINGS{Hertz02error-freegarbage,
author = {Matthew Hertz and Stephen M Blackburn and J Eliot B Moss and Kathryn S. McKinley and Darko Stefanovic},
title = {Error-Free Garbage Collection Traces: How to Cheat and Not Get Caught},
booktitle = {IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SYSTEMS (SIGMETRICS 2002},
year = {2002},
pages = {140--151},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Programmers are writing a large and rapidly growing number of programs in object-oriented languages such as Java that require garbage collection (GC). To explore the design and evaluation of GC algorithms quickly, researchers are using simulation based on traces of object allocation and lifetime behavior. The brute force method generates perfect traces using a whole-heap GC at every potential GC point in the program. Because this process is prohibitively expensive, researchers often use granulated traces by collecting only periodically, e.g., every 32K bytes of allocation.
