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

DOI10.1016/J.TCS.2012.04.037MaRDI QIDQ442277zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 814829 (Why is no real title available?)
• A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
• Atomic snapshots of shared memory
• Causal memory: definitions, implementation, and programming
• Detecting causal relationships in distributed computations: In search of the holy grail
• Formal Aspects of Serializability in Database Concurrency Control
• Multi-writer consistency conditions for shared memory objects
• Plausible clocks: constant size logical clocks for distributed systems
• Software transactional memory
• The serializability of concurrent database updates
• Time, clocks, and the ordering of events in a distributed system

Cited in

(9)

• A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
• Towards a universal construction for transaction-based multiprocess programs
• Mechanized proofs of opacity: a comparison of two techniques
• A single-version STM that is multi-versioned permissive
• Last-use opacity: a strong safety property for transactional memory with prerelease support
• SMV: selective multi-versioning STM
• A Lazy Snapshot Algorithm with Eager Validation
• A verified durable transactional mutex lock for persistent x86-TSO
• Verifying opacity of a transactional mutex lock

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)