A Generational Mostly-concurrent Garbage Collector (2000)
Cached
Download Links
- [research.sun.com]
- [www.sun.com]
- [www.cs.purdue.edu]
- [www.cs.purdue.edu]
- [www.cs.purdue.edu]
- [research.sun.com]
- [research.sun.com]
- [labs.oracle.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the International Symposium on Memory Management |
| Citations: | 43 - 6 self |
BibTeX
@INPROCEEDINGS{Printezis00agenerational,
author = {Tony Printezis},
title = {A Generational Mostly-concurrent Garbage Collector},
booktitle = {In Proceedings of the International Symposium on Memory Management},
year = {2000},
pages = {143--154},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper reports our experiences with a mostly-concurrent incremental garbage collector, implemented in the context of a high performance virtual machine for the Java programming language. The garbage collector is based on the "mostly parallel" collection algorithm of Boehm et al. and can be used as the old generation of a generational memory system. It overloads e#cient write-barrier code already generated to support generational garbage collection to also identify objects that were modified during concurrent marking. These objects must be rescanned to ensure that the concurrent marking phase marks all live objects. This algorithm minimises maximum garbage collection pause times, while having only a small impact on the average garbage collection pause time and overall execution time. We support our claims with experimental results, for both a synthetic benchmark and real programs. 1. INTRODUCTION Programming languages that rely on garbage collection have existed since the late 195...
