Causal memory: definitions, implementation, and programming

DOI10.1007/BF01784241MaRDI QIDQ5137003zbMATHOpenAlexFDO

Authors Mustaque Ahamad, James E. Burns, Prince Kohli, Phillip W. Hutto, Gil Neiger

Publication date 30 November 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01784241

zbMATH Keywords

sequential consistencydistributed shared memorymemory consistencycausal memory

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• On verifying causal consistency
• From causal consistency to sequential consistency in shared memory systems
• A unified theory of shared memory consistency
• On the interconnection of causal memory systems
• scientific article; zbMATH DE number 7141420

Cites work

• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• Axioms for memory access in asynchronous hardware systems
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Myths about the mutual exclusion problem
• On interprocess communication. I: Basic formalism
• Time, clocks, and the ordering of events in a distributed system

Cited in

(35)

• The causal ordering abstraction and a simple way to implement it
• Read-write causality
• Implementing hybrid consistency with high-level synchronization operations
• Implementing set objects in dynamic distributed systems
• Data-race and concurrent-write freedom are undecidable.
• On verifying causal consistency
• Implementing sequentially consistent programs on processor consistent platforms
• Opportunistic monitoring of multithreaded programs
• Optimal propagation-based protocols implementing causal memories
• Making Linearizability Compositional for Partially Ordered Executions
• The weakest memory-access order
• Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
• Brief Announcement: The MBroadcast Abstraction
• Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding
• A unified theory of shared memory consistency
• Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
• Principles of Distributed Systems
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• Hundreds of impossibility results for distributed computing
• scientific article; zbMATH DE number 1950677 (Why is no real title available?)
• Robustness Against Transactional Causal Consistency.
• Optimal stateless model checking for causal consistency
• Rely-guarantee reasoning for causally consistent shared memory
• Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
• Generalized Paxos made Byzantine (and less complex)
• On the interconnection of causal memory systems
• Linearizable read/write objects
• Chapar: certified causally consistent distributed key-value stores
• scientific article; zbMATH DE number 7327945 (Why is no real title available?)
• Checking causal consistency of distributed databases
• Remarks on memory consistency description
• On the composability of consistency conditions
• On the interconnection of causal memory systems
• Sound concurrent traces for online monitoring
• Relationships between memory models

This page was built for publication: Causal memory: definitions, implementation, and programming

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