Write barrier elision for concurrent garbage collectors

13 years 3 months ago
Write barrier elision for concurrent garbage collectors
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. General Terms Experimentation, Languages, Measurement, Performance Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features—Dynamic storage management; D.3.4 [Programming Languages]: Processors—Memory management (garbage collection); D.4.2 [...
Martin T. Vechev, David F. Bacon
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where IWMM
Authors Martin T. Vechev, David F. Bacon
Comments (0)