The semantics of progress in lock-based transactional memory

DOI10.1145/1480881.1480931MaRDI QIDQ5261536zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

lower boundsemanticsreductionconsensus numberimpossibilitylocktransactional memorytry-lock

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Recommendations

• Transactional Memory: Glimmer of a Theory
• On the liveness of transactional memory
• scientific article; zbMATH DE number 7075928
• Towards formally specifying and verifying transactional memory
• Privatization-safe transactional memories

Cited in

(24)

• From causal to z-linearizable transactional memory
• HiperTM: high performance, fault-tolerant transactional memory
• A single-version STM that is multi-versioned permissive
• Privatization-safe transactional memories
• On the liveness of transactional memory
• In the search for optimal concurrency
• Transactional scheduling for read-dominated workloads
• Weak atomicity for the x86 memory consistency model
• Coarse-grained transactions
• \(\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
• Semantics of transactional memory and automatic mutual exclusion
• The PCL theorem: transactions cannot be parallel, consistent, and live
• Extensible transactional memory testbed
• Inherent limitations on disjoint-access parallel implementations of transactional memory
• A template for implementing fast lock-free trees using HTM
• Last-use opacity: a strong safety property for transactional memory with prerelease support
• Transactional memory
• Transactional Lock Elision Meets Combining
• Executing Java programs with transactional memory
• Universal constructions that ensure disjoint-access parallelism and wait-freedom
• 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)