Modular Transactions: Bounding Mixed Races in Space and Time

Brijesh Dongol, Radha Jagadeesan and James Riely

Proceedings of PPoPP 2019: 24th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming

Association for Computing Machinery (ACM)

PPoPP 2019: 24th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (Washington, DC, USA, 16/02/2019–20/02/2019)

02/2019

DOI: https://doi.org/10.1145/3293883.3295708

Abstract

CCS Concepts; Theory of computation → Parallel computing models; Abstraction

We define local transactional race freedom (LTRF), which provides a programmer model for software transactional memory. LTRF programs satisfy the SC-LTRF property, thus allowing the programmer to focus on sequential executions in which transactions execute atomically. Unlike previous results, SCLTRF does not require global race freedom.We also provide a lower-level implementation model to reason about quiescence fences and validate numerous compiler optimizations.

Files and links (3)

pdf

Modular Transactions - Bounding Mixed Races in Space and Time3.03 MBDownload View

Text Open Access

url

https://doi.org/10.1145/3293883.3295708View

Published (Version of record)

url

https://ppopp19.sigplan.org/homeView

Organisation

Metrics

Details

Title: Modular Transactions: Bounding Mixed Races in Space and Time
Creators: Brijesh Dongol
Radha Jagadeesan
James Riely
Publication Details: Proceedings of PPoPP 2019: 24th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming
Conference: PPoPP 2019: 24th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (Washington, DC, USA, 16/02/2019–20/02/2019)
Publisher: Association for Computing Machinery (ACM)
Publication Date: 02/2019
Grant note: Funder: Engineering and Physical Sciences Research Council (EPSRC) | Grant ID: EP/R032556/1
Identifiers: 99512699902346
Copyright: © 2019 Association for Computing Machinery. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
Academic Unit: Department of Computer Science
Resource Type: Conference presentation

Modular Transactions: Bounding Mixed Races in Space and Time

Abstract

Files and links (3)

Metrics

Details

Usage Policy