SMV: selective multi-versioning STM

DOI10.1007/978-3-642-24100-0_9MaRDI QIDQ3095323zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

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

Cites work

• scientific article; zbMATH DE number 986407 (Why is no real title available?)
• scientific article; zbMATH DE number 5657406 (Why is no real title available?)
• A Lazy Snapshot Algorithm with Eager Validation
• On avoiding spare aborts in transactional memory
• SMV: selective multi-versioning STM
• Software transactional memory
• Transactional mutex locks
• Versioned boxes as the basis for memory transactions

Cited in

(4)

• 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
• A single-version STM that is multi-versioned permissive
• SMV: selective multi-versioning STM

Describes a project that uses

Uses Software

• STMBench7
• STAMP
• RingSTM
• TLRW

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)