Monotonic Prefix Consistency in Distributed Systems

Abstract : 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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01824817
Contributor : Hal Ifip <>
Submitted on : Wednesday, June 27, 2018 - 3:55:32 PM
Last modification on : Tuesday, April 2, 2019 - 2:23:29 AM
Long-term archiving on : Thursday, September 27, 2018 - 2:56:06 AM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2021-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Alain Girault, Gregor Gössler, Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi. Monotonic Prefix Consistency in Distributed Systems. FORTE 2018 - 38th International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Jun 2018, Madrid, Spain. pp.41-57, ⟨10.1007/978-3-319-92612-4_3⟩. ⟨hal-01824817⟩

Share

Metrics

Record views

614