Consistency in non-transactional distributed storage systems
Over the years, different meanings have been associated with the word consistency in the
distributed systems community. While in the'80s “consistency” typically meant strong …
distributed systems community. While in the'80s “consistency” typically meant strong …
Incremental consistency guarantees for replicated objects
Programming with replicated objects is difficult. Developers must face the fundamental trade-
off between consistency and performance head on, while struggling with the complexity of …
off between consistency and performance head on, while struggling with the complexity of …
Legion: Enriching internet services with peer-to-peer interactions
Many web applications are built around direct interactions among users, from collaborative
applications and social networks to multi-user games. Despite being user-centric, these …
applications and social networks to multi-user games. Despite being user-centric, these …
Practical client-side replication: Weak consistency semantics for insecure settings
Client-side replication and direct client-to-client synchronization can be used to create highly
available, low-latency interactive applications. Causal consistency, the strongest available …
available, low-latency interactive applications. Causal consistency, the strongest available …
Wren: Nonblocking reads in a partitioned transactional causally consistent data store
K Spirovska, D Didona… - 2018 48th Annual IEEE …, 2018 - ieeexplore.ieee.org
Transactional Causal Consistency (TCC) extends causal consistency, the strongest
consistency model compatible with availability, with interactive read-write transactions, and …
consistency model compatible with availability, with interactive read-write transactions, and …
Characterizing and adapting the consistency-latency tradeoff in distributed key-value stores
The CAP theorem is a fundamental result that applies to distributed storage systems. In this
article, we first present and prove two CAP-like impossibility theorems. To state these …
article, we first present and prove two CAP-like impossibility theorems. To state these …
Reliable, consistent, and efficient data sync for mobile apps
Mobile apps need to manage data, often across devices, to provide users with a variety of
features such as seamless access, collaboration, and offline editing. To do so reliably, an …
features such as seamless access, collaboration, and offline editing. To do so reliably, an …
Highly-available and consistent group collaboration at the edge with colony
Edge applications, such as gaming, cooperative engineering, or in-the-field information
sharing, enjoy immediate response, autonomy and availability by distributing and replicating …
sharing, enjoy immediate response, autonomy and availability by distributing and replicating …
Observable atomic consistency for CvRDTs
The development of distributed systems requires developers to balance the need for
consistency, availability, and partition tolerance. Conflict-free replicated data types (CRDTs) …
consistency, availability, and partition tolerance. Conflict-free replicated data types (CRDTs) …
Diamond: Automating Data Management and Storage for {Wide-Area}, Reactive Applications
Users of today's popular wide-area apps (eg, Twitter, Google Docs, and Words with Friends)
must no longer save and reload when updating shared data; instead, these applications are …
must no longer save and reload when updating shared data; instead, these applications are …