School of Computing

The locality of concurrent write barriers (extended version)

Laurence Hellyer, Richard Jones, and Antony L. Hosking

Technical Report 3-10, School of Computing, University of Kent, Canterbury, Kent CT2 7NF, UK, June 2010.


Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular systems have been widely studied. Somewhat fewer studies have also compared barriers in terms of their termination properties or the volume of floating garbage they generate. Until now, the consequences for locality of different barrier choices has not been studied, although locality will be of increasing importance for emerging architectures. This report expands upon our ISMM 2010 paper and provides a study of the locality of concurrent write barriers, independent of the processor architecture, virtual machine, compiler or garbage collection algorithm.

Download publication 7451 kbytes (PDF)

Bibtex Record

author = {Laurence Hellyer and Richard Jones and Antony L. Hosking},
title = {The Locality of Concurrent Write Barriers (extended version)},
month = {June},
year = {2010},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {},
    publication_type = {techreport},
    submission_id = {20683_1275469594},
    institution = {School of Computing},
    number = {3-10},
    address = {University of Kent, Canterbury, Kent CT2 7NF, UK},

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014