A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition

DOI10.1007/978-3-642-11476-2_21zbMath1274.68015OpenAlexW2123076748MaRDI QIDQ3408177

Damien Imbs, Michel Raynal

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_21

zbMATH Keywords

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

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (2)

Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) ⋮ Non-interference and local correctness in transactional memory

Cites Work

• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• A note on atomicity: boosting Test\&Set to solve consensus
• On interprocess communication. I: Basic formalism
• Detecting causal relationships in distributed computations: In search of the holy grail
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• The serializability of concurrent database updates
• Atomic snapshots of shared memory
• Software transactional memory
• Distributed Computing

This page was built for publication: A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition