Partially Replicated Causally Consistent Shared Memory

DOI10.1145/3293611.3331600OpenAlexW2964321400WikidataQ130983013 ScholiaQ130983013MaRDI QIDQ5145248FDOQ5145248

Authors Zhuolun Xiang, Nitin H. Vaidya 

Publication date 20 January 2021

Published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.05424

zbMATH Keywords

lower boundsdistributed shared memorycausal consistencytight conditions

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Causal memory: definitions, implementation, and programming
• Optimal propagation-based protocols implementing causal memories
• On the interconnection of causal memory systems
• From causal consistency to sequential consistency in shared memory systems
• On verifying causal consistency

Cited In (3)

• An efficient causal logging scheme for recoverable distributed shared memory systems
• From causal consistency to sequential consistency in shared memory systems
• Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding

This page was built for publication: Partially Replicated Causally Consistent Shared Memory

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