SMV: selective multi-versioning STM
From MaRDI portal
Publication:3095323
DOI10.1007/978-3-642-24100-0_9zbMATH Open1350.68049OpenAlexW2151467437MaRDI QIDQ3095323FDOQ3095323
Authors: Dmitri Perelman, Anton Byshevsky, Oleg Litmanovich, Idit Keidar 
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_9
Recommendations
- A single-version STM that is multi-versioned permissive
- Locking Timestamps versus Locking Objects
- 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)
- Versioned boxes as the basis for memory transactions
Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Title not available (Why is that?)
- Software transactional memory
- On avoiding spare aborts in transactional memory
- A Lazy Snapshot Algorithm with Eager Validation
- Title not available (Why is that?)
- SMV: selective multi-versioning STM
- Versioned boxes as the basis for memory transactions
- Transactional mutex locks
Cited In (4)
- A single-version STM that is multi-versioned permissive
- SMV: selective multi-versioning STM
- An efficient approach to achieve compositionality using optimized multi-version object based transactional systems
- Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
Uses Software
This page was built for publication: SMV: selective multi-versioning STM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095323)
