Analyzing consistency properties for fun and profit

DOI10.1145/1993806.1993834MaRDI QIDQ2943399zbMATH OpenOpenAlexFDO

Authors Wojciech Golab, Xiaozhou (Steve) Li, Mehul A. Shah

Publication date 11 September 2015

Published in Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1993806.1993834

zbMATH Keywords

consistencyatomicitykey-value store

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Computing weak consistency in polynomial time (extended abstract)
• Analyzing linearizability violations in the presence of read-modify-write operations
• Computing \(k\)-atomicity in polynomial time
• Serializability for eventual consistency: criterion, analysis, and applications
• On verifying causal consistency

Cites work

• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• Almost-Everywhere Secure Computation
• Broadcasting in dynamic radio networks
• Consensus algorithms with one-bit messages
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Fault Tolerance in Networks of Bounded Degree
• Flooding time in edge-Markovian dynamic graphs
• Gradient clock synchronization in dynamic networks
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Knowledge and common knowledge in a distributed environment
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
• Optimal gradient clock synchronization in dynamic networks
• Parsimonious flooding in dynamic graphs
• Perfectly secure message transmission
• Programming simultaneous actions using common knowledge
• Reaching Agreement in the Presence of Faults

Cited in

(3)

• Analyzing linearizability violations in the presence of read-modify-write operations
• Computing \(k\)-atomicity in polynomial time
• Taming tail latency in key-value stores: a scheduling perspective

This page was built for publication: Analyzing consistency properties for fun and profit

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