Software transactional memory
From MaRDI portal
Recommendations
Cites work
- A performance evaluation of lock-free synchronization protocols
- A steady state analysis of diffracting trees
- Counting networks
- Disjoint-access-parallel implementations of strong shared memory primitives
- scientific article; zbMATH DE number 1346491 (Why is no real title available?)
- Introduction to algorithms.
- Performance issues in non-blocking synchronization on shared-memory multiprocessors
Cited in
(55)- An analytic framework for performance modeling of software transactional memory
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores
- Software trace cache for commercial applications
- Non-blocking Patricia tries with replace operations
- Vats: a safe, reactive storage abstraction
- Fast scheduling in distributed transactional memory
- Dynamic scheduling in distributed transactional memory
- Load balanced distributed directories
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Distributed transactional memory for general networks
- HiperTM: high performance, fault-tolerant transactional memory
- Built-in coloring for highly-concurrent doubly-linked lists
- AtomCaml: first-class atomicity via rollback
- Partial aborts for transactions via first-class continuations
- Transactional mutex locks
- Semantics of transactional memory and automatic mutual exclusion
- Distributed universality
- A Lazy Snapshot Algorithm with Eager Validation
- Permissiveness in Transactional Memories
- Software Transactional Memory on Relaxed Memory Models
- Towards a universal construction for transaction-based multiprocess programs
- Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
- Parallelism, concurrency and distribution in constraint handling rules: a survey
- Weak atomicity for the x86 memory consistency model
- scientific article; zbMATH DE number 1830935 (Why is no real title available?)
- Highly-efficient wait-free synchronization
- Leaplist: lessons learned in designing TM-supported range queries
- Verifying opacity of a transactional mutex lock
- Correctness of an STM Haskell implementation
- Coarse-grained transactions
- Brief announcement: Proust: a design space for highly-concurrent transactional data structures
- A template for implementing fast lock-free trees using HTM
- SNZI, scalable nonzero indicators
- Transactions and privatization in Delaunay triangulation
- Privatization techniques for software transactional memory
- From causal to z-linearizable transactional memory
- The power of DCAS, highly-concurrent software transactional memory
- Transactional events
- A Concurrent Calculus with Atomic Transactions
- Stable scheduling in transactional memory
- Flexible scheduling of transactional memory on trees
- Flexible scheduling of transactional memory on trees
- Ordered scheduling in control-flow distributed transactional memory
- Highly concurrent multi-word synchronization
- Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
- Transactional memory
- Adaptive locks: combining transactions and locks for efficient concurrency
- Lightweight transactional memory systems for NoCs based architectures: design, implementation and comparison of two policies
- Extensible transactional memory testbed
- Implementation tradeoffs in the design of flexible transactional memory support
- A single-version STM that is multi-versioned permissive
- Fast and fair randomized wait-free locks
- Executing Java programs with transactional memory
- Designing a software transactional memory for peer-to-peer systems
- Nebelung: Execution environment for transactional openmp
This page was built for publication: Software transactional memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137331)
