The semantics of progress in lock-based transactional memory
DOI10.1145/1480881.1480931zbMATH Open1315.68065OpenAlexW2168704934MaRDI QIDQ5261536FDOQ5261536
Authors: Michał Kapałka, Rachid Guerraoui 
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.5981
Recommendations
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)
Cited In (18)
- HiperTM: high performance, fault-tolerant transactional memory
- Privatization-safe transactional memories
- A single-version STM that is multi-versioned permissive
- Transactional scheduling for read-dominated workloads
- Weak atomicity for the x86 memory consistency model
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores
- Adaptive locks: combining transactions and locks for efficient concurrency
- Proving opacity of transactional memory with early release
- In the Search for Optimal Concurrency
- Extensible transactional memory testbed
- Inherent limitations on disjoint-access parallel implementations of transactional memory
- Last-use opacity: a strong safety property for transactional memory with prerelease support
- Transactional Lock Elision Meets Combining
- Transactional memory
- Universal constructions that ensure disjoint-access parallelism and wait-freedom
- Executing Java programs with transactional memory
- Transactional mutex locks
- Perspectives on Transactional Memory
This page was built for publication: The semantics of progress in lock-based transactional memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261536)
