Write barrier elision for concurrent garbage collectors

Authors:
Martin T. Vechev;David F. Bacon
Affiliations:
Cambridge University, Cambridge, U.K.;IBM T.J. Watson Research Center, Yorktown Heights, NY
Venue:
Proceedings of the 4th international symposium on Memory management
Year:
2004

Citing 27
Cited 8

Real-time garbage collection on general-purpose machines

Journal of Systems and Software
Barrier techniques for incremental tracing

Proceedings of the 1st international symposium on Memory management
A brief introduction to regions

Proceedings of the 1st international symposium on Memory management
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM
Multiprocessing compactifying garbage collection

Communications of the ACM
A generational mostly-concurrent garbage collector

Proceedings of the 2nd international symposium on Memory management
Implementing an on-the-fly garbage collector for Java

Proceedings of the 2nd international symposium on Memory management
A parallel, real-time garbage collector

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Using annotations to reduce dynamic optimization time

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Exploiting prolific types for memory management and optimizations

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An on-the-fly reference counting garbage collector for Java

OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Error-free garbage collection traces: how to cheat and not get caught

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding the connectivity of heap objects

Proceedings of the 3rd international symposium on Memory management
An adaptive, region-based allocator for java

Proceedings of the 3rd international symposium on Memory management
In or out?: putting write barriers in their place

Proceedings of the 3rd international symposium on Memory management
Creating and preserving locality of java applications at allocation and garbage collection times

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Write barrier removal by static analysis

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A real-time garbage collector with low overhead and consistent utilization

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental Collection of Mature Objects

IWMM '92 Proceedings of the International Workshop on Memory Management
Uniprocessor Garbage Collection Techniques

IWMM '92 Proceedings of the International Workshop on Memory Management
Concurrent Remembered Set Refinement in Generational Garbage Collection

Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium
Trading data space for reduced time and code space in real-time garbage collection on stock hardware

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Mostly concurrent garbage collection revisited

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
An on-the-fly mark and sweep garbage collector based on sliding views

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Connectivity-based garbage collection

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
The Jalapeño virtual machine

IBM Systems Journal
Barriers: friend or foe?

Proceedings of the 4th international symposium on Memory management

Compile-Time Concurrent Marking Write Barrier Removal

Proceedings of the international symposium on Code generation and optimization
Compiler optimizations for nondeferred reference: counting garbage collection

Proceedings of the 5th international symposium on Memory management
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast

Proceedings of the 6th international symposium on Memory management
Path specialization: reducing phased execution overheads

Proceedings of the 7th international symposium on Memory management
Perspectives on Transactional Memory

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Compile-time concurrent marking write barrier removal

Compile-time concurrent marking write barrier removal
Dynamic filtering: multi-purpose architecture support for language runtime systems

Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems
Reducing and eliding read barriers for concurrent garbage collectors

Proceedings of the 6th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems

Quantified Score

Hi-index	0.00

Visualization

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.