Inherent limitations on disjoint-access parallel implementations of transactional memory

DOI10.1007/s00224-010-9304-5zbMath1253.68025OpenAlexW2078361851MaRDI QIDQ693754

Alessia Milani, Eshcar Hillel, Hagit Attiya

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

zbMATH Keywords

lower bounddisjoint-access parallelismimpossibility resulttransactional memorypartial snapshots

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Universal constructions that ensure disjoint-access parallelism and wait-freedom ⋮ The complexity of updating snapshot objects ⋮ A single-version STM that is multi-versioned permissive ⋮ Non-interference and local correctness in transactional memory

Cites Work

• Unnamed Item
• Unnamed Item
• The time complexity of updating snapshot memories
• On avoiding spare aborts in transactional memory
• A Lazy Snapshot Algorithm with Eager Validation
• Permissiveness in Transactional Memories
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• The serializability of concurrent database updates
• Atomic snapshots of shared memory
• The semantics of progress in lock-based transactional memory
• Disjoint-access-parallel implementations of strong shared memory primitives
• The complexity of updating multi-writer snapshot objects
• From causal to z-linearizable transactional memory

This page was built for publication: Inherent limitations on disjoint-access parallel implementations of transactional memory