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

Andrew McPherson; Vijay Nagarajan; Susmit Sarkar; Marcelo Cintra

doi:10.1145/2688500.2688524

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

Andrew McPherson, Vijay Nagarajan, Susmit Sarkar, Marcelo Cintra

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	PPoPP 2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Place of Publication	New York, NY
Publisher	ACM
Pages	249-250
Number of pages	2
ISBN (Print)	9781450332057
DOIs	https://doi.org/10.1145/2688500.2688524
Publication status	Published - 24 Jan 2015
Event	20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - San Francisco Airport Marriott Waterfront, San Franciso, United States Duration: 7 Feb 2015 → 11 Feb 2015

Conference

Conference	20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Country/Territory	United States
City	San Franciso
Period	7/02/15 → 11/02/15

Keywords

Fence placement
Relaxed memory models

Access to Document

10.1145/2688500.2688524

ppopp2015-short
© 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
Accepted author manuscript, 132 KB

Cite this

@inproceedings{cdd438667e82477bb3517480df5fbd28,

title = "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 to2.64x.",

keywords = "Fence placement, Relaxed memory models",

author = "Andrew McPherson and Vijay Nagarajan and Susmit Sarkar and Marcelo Cintra",

note = "Date of Acceptance: 10/12/2014; 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming ; Conference date: 07-02-2015 Through 11-02-2015",

year = "2015",

month = jan,

day = "24",

doi = "10.1145/2688500.2688524",

language = "English",

isbn = "9781450332057",

pages = "249--250",

booktitle = "PPoPP 2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming",

publisher = "ACM",

address = "United States",

}

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, NY, 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

Fence placement for legacy data-race-free programs via synchronization read detection. / McPherson, Andrew; Nagarajan, Vijay; Sarkar, Susmit et al.
PPoPP 2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. New York, NY: ACM, 2015. p. 249-250.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - McPherson, Andrew

AU - Nagarajan, Vijay

AU - Sarkar, Susmit

AU - Cintra, Marcelo

N1 - Date of Acceptance: 10/12/2014

PY - 2015/1/24

Y1 - 2015/1/24

N2 - 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 to2.64x.

AB - 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 to2.64x.

KW - Fence placement

KW - Relaxed memory models

U2 - 10.1145/2688500.2688524

DO - 10.1145/2688500.2688524

M3 - Conference contribution

SN - 9781450332057

SP - 249

EP - 250

BT - PPoPP 2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

PB - ACM

CY - New York, NY

T2 - 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

Y2 - 7 February 2015 through 11 February 2015

ER -

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

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this