Monotonic Prefix Consistency in Distributed Systems

We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that queries are always eventually answered). In such a setting, strong consistency, where all replicas of the system apply synchronously every operation, is not possible to implement. However, many weaker consistency criteria that allow a greater number of behaviors than strong consistency, are implementable in available distributed systems. We focus on determining the strongest consistency criterion that can be implemented in a convergent and available distributed system that tolerates partitions. We focus on objects where the set of operations can be split into updates and queries. We show that no criterion stronger than Monotonic Prefix Consistency (MPC) can be implemented.

Presented at:
38th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Madrid, Spain, June 18-20, 2018
May 30 2018
Other identifiers:

 Record created 2018-06-21, last modified 2019-06-19

Rate this document:

Rate this document:
(Not yet reviewed)