The locality of concurrent write barriers

  • Authors:
  • Laurence Hellyer;Richard Jones;Antony L. Hosking

  • Affiliations:
  • University of Kent, Canterbury, United Kingdom;University of Kent, Canterbury, United Kingdom;Purdue University, West Lafayette, IN, USA

  • Venue:
  • Proceedings of the 2010 international symposium on Memory management
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

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.