Header menu link for other important links
Bounding data races in space and time
Dolan Stephen, , Madhavapeddy Anil
Published in ACM Press
Pages: 242 - 255

We propose a new semantics for shared-memory parallel programs that gives strong guarantees even in the presence of data races. Our local data race freedom property guarantees that all data-race-free portions of programs exhibit sequential semantics. We provide a straightforward operational semantics and an equivalent axiomatic model, and evaluate an implementation for the OCaml programming language. Our evaluation demonstrates that it is possible to balance a comprehensible memory model with a reasonable (no overhead on x86, ~0.6% on ARM) sequential performance trade-off in a mainstream programming language.

About the journal
JournalData powered by TypesetProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation
PublisherData powered by TypesetACM Press
Open AccessNo