Monotonic Prefix Consistency in Distributed Systems - Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2018) Access content directly
Conference Papers Year : 2018

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.
Fichier principal
Vignette du fichier
469043_1_En_3_Chapter.pdf (346.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01824817 , version 1 (27-06-2018)

Licence

Attribution

Identifiers

Cite

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⟩
174 View
43 Download

Altmetric

Share

Gmail Facebook X LinkedIn More