Causal memory: definitions, implementation, and programming
From MaRDI portal
Publication:5137003
DOI10.1007/BF01784241zbMath1448.68057OpenAlexW2026697016MaRDI QIDQ5137003
Phillip W. Hutto, Mustaque Ahamad, James E. Burns, Prince Kohli, 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
Related Items
Implementing set objects in dynamic distributed systems ⋮ Generalized Paxos made Byzantine (and less complex) ⋮ Relationships between memory models ⋮ Unnamed Item ⋮ Checking causal consistency of distributed databases ⋮ Sound concurrent traces for online monitoring ⋮ Data-race and concurrent-write freedom are undecidable. ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ 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 ⋮ Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) ⋮ Implementing hybrid consistency with high-level synchronization operations ⋮ Hundreds of impossibility results for distributed computing ⋮ Robustness Against Transactional Causal Consistency. ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ On the composability of consistency conditions ⋮ Linearizable read/write objects
Cites Work
- Unnamed Item
- On interprocess communication. I: Basic formalism
- Myths about the mutual exclusion problem
- Axioms for memory access in asynchronous hardware systems
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Time, clocks, and the ordering of events in a distributed system
