St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Fence placement for legacy data-race-free programs via synchronization read detection

Thumbnail
View/Open
ppopp2015_short.pdf (131.7Kb)
Date
24/01/2015
Author
McPherson, Andrew
Nagarajan, Vijay
Sarkar, Susmit
Cintra, Marcelo
Keywords
Fence placement
Relaxed memory models
QA75 Electronic computers. Computer science
NDAS
MCP
Metadata
Show full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
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
DOI
https://doi.org/10.1145/2688500.2688524
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/2014
Collections
  • University of St Andrews Research
URI
http://hdl.handle.net/10023/7409

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter