Fence placement for legacy data-race-free programs via synchronization read detection
Abstract
Fence 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.
Citation
McPherson , 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.2688524 conference
Publication
PPoPP 2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Type
Conference item
Rights
© ACM, 2015. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in PPoPP 2015 Proceedings, available from http://dl.acm.org
Description
Date of Acceptance: 10/12/2014Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.