A Lazy Snapshot Algorithm with Eager Validation

DOI10.1007/11864219_20zbMATH Open1155.68341OpenAlexW1523021320MaRDI QIDQ3524312FDOQ3524312

Authors: Torvald Riegel, Pascal Felber, Christof Fetzer 

Publication date: 9 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/18139/files/Riegel_Torvald_-_A_Lazy_Snapshot_Algorithm_with_Eager_Validation_20100430.pdf

Recommendations

• 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)
• Software transactional memory
• Privatization techniques for software transactional memory
• Time-Lapse Snapshots

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (8)

• A single-version STM that is multi-versioned permissive
• SMV: selective multi-versioning STM
• Bounds on contention management algorithms
• Permissiveness in Transactional Memories
• Extensible transactional memory testbed
• Inherent limitations on disjoint-access parallel implementations of transactional memory
• Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
• Transactional memory

This page was built for publication: A Lazy Snapshot Algorithm with Eager Validation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524312)