Show simple item record

dc.contributor.authorDolan, Stephenen
dc.contributor.authorSivaramakrishnan, KCen
dc.contributor.authorMadhavapeddy, Anilen
dc.date.accessioned2019-06-28T14:53:10Z
dc.date.available2019-06-28T14:53:10Z
dc.date.issued2018-06-11en
dc.identifier.issn1523-2867
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/294145
dc.description.abstract© 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.
dc.language.isoenen
dc.titleBounding data races in space and timeen
dc.typeConference Object
prism.issueIdentifier4en
prism.publicationDate2018en
prism.publicationNameACM SIGPLAN Noticesen
prism.volume53en
dc.identifier.doi10.17863/CAM.41245
dcterms.dateAccepted2018-02-12en
rioxxterms.versionofrecord10.1145/3192366.3192421en
rioxxterms.versionAMen
rioxxterms.licenseref.urihttp://www.rioxx.net/licenses/all-rights-reserveden
rioxxterms.licenseref.startdate2018-06-11en
dc.contributor.orcidMadhavapeddy, Anil [0000-0001-8954-2428]
rioxxterms.typeConference Paper/Proceeding/Abstracten
pubs.funder-project-idRoyal Commission for the Exhibition of 1851 (200684)
cam.issuedOnline2018-06-11en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record