Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorMcPherson, Andrew
dc.contributor.authorNagarajan, Vijay
dc.contributor.authorSarkar, Susmit
dc.contributor.authorCintra, Marcelo
dc.date.accessioned2015-09-07T09:40:04Z
dc.date.available2015-09-07T09:40:04Z
dc.date.issued2015-01-24
dc.identifier214249004
dc.identifiercdd43866-7e82-477b-b351-7480df5fbd28
dc.identifier84939153684
dc.identifier000367254800024
dc.identifier.citationMcPherson , A , Nagarajan , V , Sarkar , S & Cintra , M 2015 , Fence placement for legacy data-race-free programs via synchronization read detection . in PPoPP 2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming . ACM , New York , pp. 249-250 , 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , San Franciso , United States , 7/02/15 . https://doi.org/10.1145/2688500.2688524en
dc.identifier.citationconferenceen
dc.identifier.isbn978-1-4503-3205-7
dc.identifier.otherORCID: /0000-0002-4259-9213/work/125727576
dc.identifier.urihttps://hdl.handle.net/10023/7409
dc.descriptionDate of Acceptance: 10/12/2014en
dc.description.abstractFence placement is required to ensure legacy parallel programs operate correctly on relaxed architectures. The challenge is to place as few fences as possible without compromising correctness. By identifying necessary conditions for a read to be an acquire we improve upon the state of the art for legacy DRF programs by up to 2.64x.
dc.format.extent134864
dc.language.isoeng
dc.publisherACM
dc.relation.ispartofPPoPP 2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programmingen
dc.subjectFence placementen
dc.subjectRelaxed memory modelsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectNDASen
dc.subjectMCPen
dc.subject.lccQA75en
dc.titleFence placement for legacy data-race-free programs via synchronization read detectionen
dc.typeConference itemen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doi10.1145/2688500.2688524


This item appears in the following Collection(s)

Show simple item record