Bounding data races in space and time
ACM SIGPLAN Notices
MetadataShow full item record
Dolan, S., Sivaramakrishnan, K., & Madhavapeddy, A. (2018). Bounding data races in space and time. ACM SIGPLAN Notices, 53 (4)https://doi.org/10.1145/3192366.3192421
© 2018 ACM. 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.
Royal Commission for the Exhibition of 1851 (200684)
External DOI: https://doi.org/10.1145/3192366.3192421
This record's URL: https://www.repository.cam.ac.uk/handle/1810/294145