Barriers: Friend or Foe? (2004)
Cached
Download Links
- [cs.anu.edu.au]
- [www.cs.umass.edu]
- [cs.anu.edu.au]
- DBLP
Other Repositories/Bibliography
| Citations: | 32 - 5 self |
BibTeX
@MISC{Blackburn04barriers:friend,
author = {Stephen M Blackburn and et al.},
title = {Barriers: Friend or Foe?},
year = {2004}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Modern garbage collectors rely on read and write barriers imposed on heap accesses by the mutator, to keep track of references between different regions of the garbage collected heap, and to synchronize actions of the mutator with those of the collector. It has been a long-standing untested assumption that barriers impose significant overhead to garbage-collected applications. As a result, researchers have devoted effort to development of optimization approaches for elimination of unnecessary barriers, or proposed new algorithms for garbage collection that avoid the need for barriers while retaining the capability for independent collection of heap partitions. On the basis of the results presented here, we dispel the assumption that barrier overhead should be a primary motivator for such efforts. We present a
