Don't settle for eventual consistency

Lloyd, Wyatt; Freedman, Michael J.; Kaminsky, Michael; Andersen, David G.

doi:10.1145/2596624

Cited by 20 publications

(15 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• For any execution α of R and e = do(del(a), _) ∈ α, if there does not exist event e = do(del(a), _) ∈ α that happens before e, then replica repl(e) has a message pending after e. The class of push-based protocols contains both op-based protocols [5], in which a message carries a description of the latest operations that the sender has performed (e.g., RGA), and statebased [5] protocols, in which a message describes all operations the sender knows about (i.e., its state). We also show ( [2, §B]) that the class of push-based protocols contains eventually consistent writepropagating protocols [3]-which model many deployed highly available eventually consistent protocols [4,5,9,11,12,18,26,33]under the natural assumption that sending a message does not affect the state of the list at the sending replica.…”

Section: Push-based Protocolsmentioning

confidence: 99%

Specification and Complexity of Collaborative Text Editing

Attiya

Burckhardt

Gotsman

et al. 2016

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

International audienceCollaborative text editing systems allow users to concurrently edit a shared document, inserting and deleting elements (e.g., characters or lines). There are a number of protocols for collaborative text editing, but so far there has been no precise specification of their desired behavior, and several of these protocols have been shown not to satisfy even basic expectations. This paper provides a precise specification of a replicated list object, which models the core func-tionality of replicated systems for collaborative text editing. We define a strong list specification, which we prove is implemented by an existing protocol, as well as a weak list specification, which admits additional protocol behaviors. A major factor determining the efficiency and practical feasibility of a collaborative text editing protocol is the space overhead of the metadata that the protocol must maintain to ensure correctness. We show that for a large class of list protocols, implementing either the strong or the weak list specification requires a metadata overhead that is at least linear in the number of elements deleted from the list. The class of protocols to which this lower bound applies includes all list protocols that we are aware of, and we show that one of these protocols almost matches the bound

show abstract

Section: Push-based Protocolsmentioning

confidence: 99%

Specification and Complexity of Collaborative Text Editing

Attiya

Burckhardt

Gotsman

et al. 2016

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…The traditional relational database management systems (RDBMSs) are unsuitable as horizontal partitioning due to relationships and dependencies among stored data is difficult [43]. Designed to guarantee consistency, RDBMSs have limited scalability and availability especially in case of network partitions [44,45], and cannot provide required latency and scalability for SNs with clusters replicating over data centers geographically dispersed [44]. Therefore, alternative data management solutions such as Cassandra [44] and Haystack [46] by Facebook, Bigtable [47] and Megastore [48] by Google were developed.…”

Section: Sn Computer Sciencementioning

confidence: 99%

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

Masinde

Graffi

2020

SN COMPUT. SCI.

View full text Add to dashboard Cite

The use of online social networks, such as Facebook and Twitter, has grown at a phenomenal rate. These platforms offer services that support interactions via messaging, chatting or audio/video conferencing, and also sharing of content. Most, if not all, of these platforms use centralized computing systems; therefore, the control and management of the systems lies entirely in the hands of one provider, who must be trusted to treat the data and communication traces securely. As a zero-trust alternative, peer-to-peer (P2P) technologies promise to support end-to-end communication, uncompromising access control, anonymity and resilience against censorship and massive data leaks through misused trust. The goals of this survey are threefold. First, the survey elaborates the properties of P2P-based online social networks and defines the requirements for such (zero-trust) platforms. Second, it gives an exposition of the building blocks for P2P frameworks that allow the creation of such sophisticated and demanding applications, such as user/identity management, reliable data storage, secure communication, access control and general-purpose extensibility, which are not properly addressed in other P2P surveys. As a third point, it gives a comprehensive analysis of proposed P2P-based online social network applications, frameworks and architectures by exploring the technical details, inter-dependencies and maturity of these solutions.

show abstract

“…Potential causality was inspired by early work on replicated databases, which attempt to maintain consistent information while serving different regions (Johnson and Thomas 1975). This application continues to draw attention to the concept due to the prevalence of large-scale social networks (Lloyd et al 2014).…”

Section: Potential Causalitymentioning

confidence: 99%

“…This property may be referred to as "weak consistency" (Rönngren and Liljenstam 1999), though this downplays its importance as the key requirement for preserving causal orderings (Lamport 1978). Moreover, "causal consistency" has an analogous meaning in the context of replicated databases (Lloyd et al 2014).…”

Section: Potential Causalitymentioning

confidence: 99%

A Taxonomy of Event Time Representations

2017

TMS/DEVS Symposium on Theory of Modeling &Amp; Simulation (TMS/DEVS 2017)

View full text Add to dashboard Cite

Terms such as "simulated time", "simulation time", "virtual time", "logical time", and "real time" appear throughout the modeling and simulation literature as a means of describing the timing, ordering, and/or processing of events. Unfortunately, this vocabulary can become a source of confusion due to subtle inconsistencies in how the terms are interpreted. Here we categorize mathematical representations of event times, review their formal properties such as causal consistency and causal characterization, identify formal relationships among the representations, and present a taxonomy to clarify the proper meanings of the most common notions of time in a simulation context. A thorough look at the various event time representations suggests new research opportunities, such as the repurposing of distributed computing techniques for debugging both parallel and sequential discrete event simulations.

show abstract

Don't settle for eventual consistency

Abstract: Stronger properties for low-latency geo-replicated storage.

Cited by 20 publications

References 8 publications

Specification and Complexity of Collaborative Text Editing

Specification and Complexity of Collaborative Text Editing

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

A Taxonomy of Event Time Representations

Contact Info

Product

Resources

About