Promising 2.0: Global optimizations in relaxed memory concurrency

Sung Hwan Lee, Minki Cho, Anton Podkopaev, Soham Chakraborty, Chung Kil Hur, Ori Lahav, Viktor Vafeiadis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For more than fifteen years, researchers have tried to support global optimizations in a usable semantics for a concurrent programming language, yet this task has been proven to be very difficult because of (1) the infamous "out of thin air" problem, and (2) the subtle interaction between global and thread-local optimizations. In this paper, we present a solution to this problem by redesigning a key component of the promising semantics (PS) of Kang et al. Our updated PS 2.0 model supports all the results known about the original PS model (i.e., thread-local optimizations, hardware mappings, DRF theorems), but additionally enables transformations based on global value-range analysis as well as register promotion (i.e., making accesses to a shared location local if the location is accessed by only one thread). PS 2.0 also resolves a problem with the compilation of relaxed RMWs to ARMv8, which required an unintended extra fence.

Original languageEnglish
Title of host publicationPLDI 2020 - Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
EditorsAlastair F. Donaldson, Emina Torlak
Pages362-376
Number of pages15
ISBN (Electronic)9781450376136
DOIs
StatePublished - 11 Jun 2020
Event41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2020 - London, United Kingdom
Duration: 15 Jun 202020 Jun 2020

Publication series

NameProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Conference

Conference41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2020
Country/TerritoryUnited Kingdom
CityLondon
Period15/06/2020/06/20

Keywords

  • Compiler Optimizations
  • Operational Semantics
  • Relaxed Memory Concurrency

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Promising 2.0: Global optimizations in relaxed memory concurrency'. Together they form a unique fingerprint.

Cite this