Brewers Conjecture and a characterization of the limits, and relationships between Consistency, Availability and Partition Tolerance in a distributed service

04/23/2019
by   Amrith Kumar, et al.
0

In designing a distributed service, three desirable attributes are Consistency, Availability and Partition Tolerance. In this note we explore a framework for characterizing these three in a manner that establishes definite limits and relationships between them, and explore some implications of this characterization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2020

Checking Causal Consistency of Distributed Databases

The CAP Theorem shows that (strong) Consistency, Availability, and Parti...
research
03/23/2020

Soteria: A Provably Compliant User Right Manager Using a Novel Two-Layer Blockchain Technology

Soteria is a user right management system designed to safeguard user-dat...
research
09/21/2023

Generalize Synchronization Mechanism: Specification, Properties, Limits

Shared resources synchronization is a well studied problem, in both shar...
research
02/08/2019

Consistency models in distributed systems: A survey on definitions, disciplines, challenges and applications

The replication mechanism resolves some challenges with big data such as...
research
02/26/2018

Observable atomic consistency for CvRDTs

The development of distributed systems requires developers to balance th...
research
02/21/2023

A note on the partition bound for one-way classical communication complexity

We present a linear program for the one-way version of the partition bou...
research
01/21/2023

Consistency vs. Availability in Distributed Real-Time Systems

In distributed applications, Brewer's CAP theorem tells us that when net...

Please sign up or login with your details

Forgot password? Click here to reset