Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)

DOI10.1016/j.tcs.2012.04.037zbMath1246.68091OpenAlexW2022984109MaRDI QIDQ442277

Damien Imbs, Michel Raynal

Publication date: 10 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.037

zbMATH Keywords

consistency conditionshared memoryconcurrency controlserializabilitytransactionatomic objectcausal pastcommit/abortconsistent global statelockread-from relationregular read/write objectsoftware transactional memoryvector clock

Mathematics Subject Classification ID

Database theory (68P15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of software (68N99)

Related Items

Last-use opacity: a strong safety property for transactional memory with prerelease support ⋮ Mechanized proofs of opacity: a comparison of two techniques ⋮ Verifying Opacity of a Transactional Mutex Lock ⋮ A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition

Cites Work

• Unnamed Item
• Unnamed Item
• Detecting causal relationships in distributed computations: In search of the holy grail
• A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
• The serializability of concurrent database updates
• Time, clocks, and the ordering of events in a distributed system
• Formal Aspects of Serializability in Database Concurrency Control
• Atomic snapshots of shared memory
• Causal memory: definitions, implementation, and programming
• Software transactional memory
• Distributed Computing

This page was built for publication: Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)