Inherent limitations on disjoint-access parallel implementations of transactional memory

DOI10.1007/S00224-010-9304-5MaRDI QIDQ693754zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

lower boundtransactional memorydisjoint-access parallelismimpossibility resultpartial snapshots

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7075928
• Transactional Memory: Glimmer of a Theory
• The semantics of progress in lock-based transactional memory
• On the liveness of transactional memory
• Privatization-safe transactional memories

Cites work

• scientific article; zbMATH DE number 5657406 (Why is no real title available?)
• scientific article; zbMATH DE number 2013836 (Why is no real title available?)
• A Lazy Snapshot Algorithm with Eager Validation
• Atomic snapshots of shared memory
• Disjoint-access-parallel implementations of strong shared memory primitives
• From causal to z-linearizable transactional memory
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• On avoiding spare aborts in transactional memory
• Permissiveness in Transactional Memories
• The complexity of updating multi-writer snapshot objects
• The semantics of progress in lock-based transactional memory
• The serializability of concurrent database updates
• The time complexity of updating snapshot memories

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)