Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
DOI10.1016/J.TCS.2012.04.037zbMATH Open1246.68091OpenAlexW2022984109MaRDI QIDQ442277FDOQ442277
Authors: 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
Recommendations
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
- Software transactional memory
- Non-interference and local correctness in transactional memory
- Value-based or conflict-based? Opacity definitions for STMs
- Towards a universal construction for transaction-based multiprocess programs
consistency conditionshared memoryconcurrency controlserializabilitytransactionatomic objectcausal pastcommit/abortconsistent global statelockread-from relationregular read/write objectsoftware transactional memoryvector clock
Database theory (68P15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of software (68N99)
Cites Work
- Causal memory: definitions, implementation, and programming
- The serializability of concurrent database updates
- Time, clocks, and the ordering of events in a distributed system
- Atomic snapshots of shared memory
- Detecting causal relationships in distributed computations: In search of the holy grail
- Software transactional memory
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
- Formal Aspects of Serializability in Database Concurrency Control
- Title not available (Why is that?)
- Plausible clocks: constant size logical clocks for distributed systems
- Multi-writer consistency conditions for shared memory objects
Cited In (9)
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
- A single-version STM that is multi-versioned permissive
- SMV: selective multi-versioning STM
- Towards a universal construction for transaction-based multiprocess programs
- Mechanized proofs of opacity: a comparison of two techniques
- A verified durable transactional mutex lock for persistent x86-TSO
- A Lazy Snapshot Algorithm with Eager Validation
- Verifying opacity of a transactional mutex lock
- Last-use opacity: a strong safety property for transactional memory with prerelease support
This page was built for publication: Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442277)
