Trading fences with RMRs and separating memory models

DOI10.1145/2767386.2767427MaRDI QIDQ2796254zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Danny Hendler, Philipp Woelfel

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2767386.2767427

zbMATH Keywords

fencesshared memorytotal store orderingTSO

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Fences in weak memory models
• Brief announcement: Fence insertion for straight-line programs is in P
• The price of being adaptive
• Counter-Example Guided Fence Insertion under TSO
• On the verification problem for weak memory models

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(2)

• Fences in weak memory models
• Brief announcement: Fence insertion for straight-line programs is in P

This page was built for publication: Trading fences with RMRs and separating memory models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796254)