Inherent limitations on disjoint-access parallel implementations of transactional memory
DOI10.1007/S00224-010-9304-5zbMATH Open1253.68025OpenAlexW2078361851MaRDI QIDQ693754FDOQ693754
Authors: Hagit Attiya, Eshcar Hillel, Alessia Milani 
Publication date: 10 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00992693/file/7.pdf
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical problems of computer architecture (68M07)
Cites Work
- The serializability of concurrent database updates
- The time complexity of updating snapshot memories
- Atomic snapshots of shared memory
- Permissiveness in Transactional Memories
- Title not available (Why is that?)
- Disjoint-access-parallel implementations of strong shared memory primitives
- On avoiding spare aborts in transactional memory
- The semantics of progress in lock-based transactional memory
- Help When Needed, But No More: Efficient Read/Write Partial Snapshot
- From causal to \(z\)-linearizable transactional memory
- A Lazy Snapshot Algorithm with Eager Validation
- Title not available (Why is that?)
- The complexity of updating multi-writer snapshot objects
Cited In (7)
- A single-version STM that is multi-versioned permissive
- Transactional memory: a primer for theorist
- Non-interference and local correctness in transactional memory
- Universal constructions that ensure disjoint-access parallelism and wait-freedom
- The PCL theorem: transactions cannot be parallel, consistent, and live
- The complexity of updating snapshot objects
- Universal constructions that ensure disjoint-access parallelism and wait-freedom
This page was built for publication: Inherent limitations on disjoint-access parallel implementations of transactional memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693754)
