A single-version STM that is multi-versioned permissive
From MaRDI portal
Publication:693077
DOI10.1007/s00224-012-9406-3zbMath1254.68063OpenAlexW2012688519MaRDI QIDQ693077
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
versionspermissivenesstransactional memorycompare-and-swap\(k\)-compare-single-swapbest-effort hardware transactional memorydisjoint access parallelism
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14)
Related Items (1)
Uses Software
Cites Work
- On avoiding spare aborts in transactional memory
- Inherent limitations on disjoint-access parallel implementations of transactional memory
- Versioned boxes as the basis for memory transactions
- Nonblocking \(k\)-compare-single-swap
- SMV: Selective Multi-Versioning STM
- A Lazy Snapshot Algorithm with Eager Validation
- Permissiveness in Transactional Memories
- The serializability of concurrent database updates
- The semantics of progress in lock-based transactional memory
- Disjoint-access-parallel implementations of strong shared memory primitives
- Disentangling multi-object operations (extended abstract)
This page was built for publication: A single-version STM that is multi-versioned permissive