A single-version STM that is multi-versioned permissive
DOI10.1007/S00224-012-9406-3zbMATH Open1254.68063OpenAlexW2012688519MaRDI QIDQ693077FDOQ693077
Authors: Hagit Attiya, Eshcar Hillel 
Publication date: 7 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-012-9406-3
Recommendations
- Permissiveness in Transactional Memories
- SMV: selective multi-versioning STM
- Software transactional memory
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
- Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
versionstransactional memorycompare-and-swap\(k\)-compare-single-swapbest-effort hardware transactional memorydisjoint access parallelismpermissiveness
Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- The serializability of concurrent database updates
- Permissiveness in Transactional Memories
- 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
- A Lazy Snapshot Algorithm with Eager Validation
- Disentangling multi-object operations (extended abstract)
- Inherent limitations on disjoint-access parallel implementations of transactional memory
- Nonblocking \(k\)-compare-single-swap
- SMV: selective multi-versioning STM
- Versioned boxes as the basis for memory transactions
Cited In (4)
Uses Software
This page was built for publication: A single-version STM that is multi-versioned permissive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693077)
