School of Computing

The locality of concurrent write barriers

Laurence Hellyer, Richard Jones, and Antony Hosking

In Jan Vitek and Doug Lea, editors, Proceedings of the 2010 International Symposium on Memory Management, pages 182-196, Toronto, Canada, June 2010. ACM The full technical report can be found at http://www.cs.kent.ac.uk/pubs/2010/3011/. [doi].

Abstract

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 paper provides a study of the locality of concurrent write barriers, independent of the processor architecture, virtual machine, compiler or garbage collection algorithm.

Download publication 386 kbytes (PDF)

Bibtex Record

@inproceedings{3012,
author = {Laurence Hellyer and Richard Jones and Antony Hosking},
title = {The Locality of Concurrent Write Barriers},
month = {June},
year = {2010},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {The full technical report can be found at http://www.cs.kent.ac.uk/pubs/2010/3011/.},
doi = {10.1145/1806651.1806666},
url = {http://www.cs.kent.ac.uk/pubs/2010/3012},
    publication_type = {inproceedings},
    submission_id = {6241_1276076088},
    ISBN = {978-1-4503-0054-4},
    booktitle = {Proceedings of the 2010 International Symposium on Memory Management},
    editor = {Jan Vitek and Doug Lea},
    address = {Toronto, Canada},
    publisher = {ACM},
    refereed = {yes},
}

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

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

Last Updated: 21/03/2014