ACM Home Page
Please provide us with feedback. Feedback
Write barrier elision for concurrent garbage collectors
Full text PdfPdf (491 KB)
Source International Symposium on Memory Management archive
Proceedings of the 4th international symposium on Memory management table of contents
Vancouver, BC, Canada
SESSION: Concurrency table of contents
Pages: 13 - 24  
Year of Publication: 2004
ISBN:1-58113-945-4
Authors
Martin T. Vechev  Cambridge University, Cambridge, U.K.
David F. Bacon  IBM T.J. Watson Research Center, Yorktown Heights, NY
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 48,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Concurrent garbage collectors require write barriers to preserve consistency, but these barriers impose significant direct and indirect costs. While there has been a lot of work on optimizing write barriers, 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 evaluate the potential for write barrier elimination with a trace-based limit study, which shows that a significant percentage of write barriers are redundant. On average, 54% of incremental barriers and 83% of snapshot barriers are unnecessary.


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
Specjvm98 benchmarks. In Standard Performance Evaluation Corporation.
 
2
3
4
5
6
7
8
9
 
10
11
12
13
14
15
 
16
17
18
 
19
Nandivada, V. K., and Detlefs, D. Compile-time concurrent marking write barrier removal. Submitted for publication, 2004.
20
21
22
23
24
25
26
 
27
 
28
29
 
30
Zorn, B. Barrier methods for garbage collection. Tech. Rep. CU-CS-494-90, University of Colorado at Boulder, 1990.


Collaborative Colleagues:
Martin T. Vechev: colleagues
David F. Bacon: colleagues