The Locality of Concurrent Write Barriers (extended version)

Hellyer, Laurence and Jones, Richard E. and Hosking, Antony L. (2010) The Locality of Concurrent Write Barriers (extended version). Technical report. , University of Kent, Canterbury, Kent CT2 7NF, UK 3-10. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://www.cs.kent.ac.uk/pubs/2010/3011

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 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.

Item Type: Monograph (Technical report)
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Richard Jones
Date Deposited: 21 Sep 2012 09:49
Last Modified: 27 May 2014 13:51
Resource URI: http://kar.kent.ac.uk/id/eprint/30658 (The current URI for this page, for reference purposes)
  • Depositors only (login required):