On the liveness of transactional memory
From MaRDI portal
Publication:2933772
DOI10.1145/2332432.2332435zbMATH Open1301.68089OpenAlexW2091067283MaRDI QIDQ2933772FDOQ2933772
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
Recommendations
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
- Title not available (Why is that?)
- 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)