Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorMcPherson, Andrew J
dc.contributor.authorNagarajan, Vijay
dc.contributor.authorSarkar, Susmit
dc.contributor.authorCintra, Marcelo
dc.date.accessioned2016-03-09T12:40:03Z
dc.date.available2016-03-09T12:40:03Z
dc.date.issued2016-01-07
dc.identifier.citationMcPherson , A J , Nagarajan , V , Sarkar , S & Cintra , M 2016 , ' Fence placement for legacy Data-Race-Free programs via synchronization read detection ' , ACM Transactions on Architecture and Code Optimization (TACO) , vol. 12 , no. 4 , 46 . https://doi.org/10.1145/2835179en
dc.identifier.issn1544-3566
dc.identifier.otherPURE: 175329206
dc.identifier.otherPURE UUID: a056d73c-8f21-49cd-a332-657620f5cff2
dc.identifier.otherScopus: 84954223670
dc.identifier.otherWOS: 000367950500014
dc.identifier.urihttp://hdl.handle.net/10023/8387
dc.descriptionWe thank the anonymous reviewers for their helpful comments for improving this article. This research is supported by EPSRC grant EP/L000725/1 and an Intel early career faculty award to the University of Edinburgh.en
dc.description.abstractShared-memory programmers traditionally assumed Sequential Consistency (SC), but modern systems have relaxed memory consistency. Here, the trend in languages is towards Data-Race-Free (DRF) models, where, assuming annotated synchronizations and the program being well-synchronized by those synchronizations, the hardware and compiler guarantee SC. However, legacy programs lack annotations, so even well-synchronized (legacy DRF) programs aren’t recognized. For legacy DRF programs, we can significantly prune the set of memory orderings determined by automated fence placement, by automatically identifying synchronization reads. We prove our rules for identifying them conservative, implement them within LLVM, and observe a 30% average performance improvement over previous techniques.
dc.format.extent23
dc.language.isoeng
dc.relation.ispartofACM Transactions on Architecture and Code Optimization (TACO)en
dc.rights© 2015, Publisher / the Author(s). This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at dl.acm.org / https://dx.doi.org/10.1145/2835179en
dc.subjectFence placementen
dc.subjectRelaxed memory modelsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectNDASen
dc.subject.lccQA75en
dc.titleFence placement for legacy Data-Race-Free programs via synchronization read detectionen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.1145/2835179
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record