Fences and Synchronisation Idioms in Weak Memory Models - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Fences and Synchronisation Idioms in Weak Memory Models


We present an axiomatic framework, implemented in the Coq proof assistant, to define weak memory models in terms of several parameters: local reorderings of reads and writes, and visibility of inter and intra processor communications through memory, including full store atomicity relaxation. Thereby, we give a formal hierarchy of weak memory models, in which we provide a formal study of what should be the action and placement of fences to restore a given model such as SC from a weaker one. Finally, we provide formal requirements for abstract locks that guarantee SC semantics to data race free programs, and show that a particular implementation of locks matches these requirements.
Fichier principal
Vignette du fichier
rr-7152.pdf (284.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00440863 , version 1 (12-12-2009)


  • HAL Id : inria-00440863 , version 1


Jade Alglave, Luc Maranget. Fences and Synchronisation Idioms in Weak Memory Models. [Research Report] RR-7152, INRIA. 2009. ⟨inria-00440863⟩
63 View
71 Download


Gmail Facebook Twitter LinkedIn More