Write barrier elision for concurrent garbage collectors (2004)
Cached
Download Links
- [researchweb.watson.ibm.com]
- [researchweb.watson.ibm.com]
- [www.research.ibm.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 4th international symposium on Memory management |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Vechev04writebarrier,
author = {Martin T. Vechev and Cambridge Cb Fd},
title = {Write barrier elision for concurrent garbage collectors},
booktitle = {In Proceedings of the 4th international symposium on Memory management},
year = {2004},
pages = {13--24},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT Concurrent garbage collectors require write barriers to preserveconsistency, but these barriers impose significant direct and indirect costs. While there has been a lot of work on optimizing write barri-ers, we present the first study of their elision in a concurrent collector. We show conditions under which write barriers are redundant,and describe how these conditions can be applied to both incremental update or snapshot-at-the-beginning barriers. We then evaluatethe potential for write barrier elimination with a trace-based limit study, which shows that a significant percentage of write barriersare redundant. On average, 54 % of incremental barriers and 83 % of snapshot barriers are unnecessary.
