Hellyer, Laurence and Jones, Richard and Hosking, Antony (2010) The Locality of Concurrent Write Barriers. In: Proceedings of the 2010 International Symposium on Memory Management.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|Item Type:||Conference or workshop item (UNSPECIFIED)|
|Additional information:||The full technical report can be found at http://www.cs.kent.ac.uk/pubs/2010/3011/.|
|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:||L.P.J. Hellyer|
|Date Deposited:||21 Sep 2012 09:49|
|Last Modified:||21 Sep 2012 09:49|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/30662 (The current URI for this page, for reference purposes)|
- Depositors only (login required):