On the liveness of transactional memory

DOI10.1145/2332432.2332435MaRDI QIDQ2933772zbMATH OpenOpenAlexFDO

Authors Victor Bushkov, Michał Kapałka, Rachid Guerraoui

Publication date 5 December 2014

Published in Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/180385

zbMATH Keywords

concurrent programminglivenesstransactional memory

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• The semantics of progress in lock-based transactional memory
• Transactional Memory: Glimmer of a Theory
• Model checking transactional memories
• scientific article; zbMATH DE number 7075928
• Towards formally specifying and verifying transactional memory

Cited in

(10)

• From causal to z-linearizable transactional memory
• Liveness-Preserving Atomicity Abstraction
• The power of DCAS, highly-concurrent software transactional memory
• The semantics of progress in lock-based transactional memory
• Characterizing Transactional Memory Consistency Conditions Using Observational Refinement
• The PCL theorem: transactions cannot be parallel, consistent, and live
• scientific article; zbMATH DE number 7075928 (Why is no real title available?)
• Inherent limitations on disjoint-access parallel implementations of transactional memory
• Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
• Universal constructions that ensure disjoint-access parallelism and wait-freedom

This page was built for publication: On the liveness of transactional memory

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