Causal memory: definitions, implementation, and programming

DOI10.1007/BF01784241zbMATH Open1448.68057OpenAlexW2026697016MaRDI QIDQ5137003FDOQ5137003

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

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

zbMATH Keywords

sequential consistencydistributed shared memorymemory consistencycausal memory

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• On interprocess communication. I: Basic formalism
• Myths about the mutual exclusion problem
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Time, clocks, and the ordering of events in a distributed system
• Axioms for memory access in asynchronous hardware systems

Cited In (29)

• Data-race and concurrent-write freedom are undecidable.
• Implementing hybrid consistency with high-level synchronization operations
• Implementing set objects in dynamic distributed systems
• On the composability of consistency conditions
• Opportunistic monitoring of multithreaded programs
• On the interconnection of causal memory systems
• Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects
• Hundreds of impossibility results for distributed computing
• Implementing sequentially consistent programs on processor consistent platforms
• Sound concurrent traces for online monitoring
• Generalized Paxos made Byzantine (and less complex)
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• Linearizable read/write objects
• Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
• Principles of Distributed Systems
• The causal ordering abstraction and a simple way to implement it
• 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
• Checking causal consistency of distributed databases
• Relationships between memory models
• Title not available (Why is that?)
• Making Linearizability Compositional for Partially Ordered Executions
• The weakest memory-access order
• Title not available (Why is that?)
• A unified theory of shared memory consistency
• Robustness Against Transactional Causal Consistency.
• Optimal stateless model checking for causal consistency
• Rely-guarantee reasoning for causally consistent shared memory

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)