Complexity of Update Consistent Universal Constructions - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Complexity of Update Consistent Universal Constructions

Complexité spaciale des constructions universelles convergentes à terme

Olivier Ruas

Résumé

In large scale distributed systems, replication is essential in order to provide availability and partition tolerance. Such systems are abstracted by the wait-free model, composed of asynchronous processes that communicate by sending and receiving messages, and in which any process may crash. The CAP theorem states that strong consistency is unachievable in the wait-free model. Weaker consistency criteria, such as eventual consistency, update consistency and causal convergence, have been identified as potential substitutes to strong consistency for the management of replicated objects. Complexity in local memory has already been studied for several objects, including sets, databases and collaborative editors. However, the literature has focused on a subclass of algorithms, called the operational model, in which processes can only broadcast one message per update operation and the read operation incurs no communication. This paper tackles the following question: are the operational model and the wait-free model equivalent from the complexity point of view? We show that eventual consistency allows implementations in the wait-free model that require strictly less local memory than their counterparts in the operational model. On the other side, we propose, for the wait-free model, a universal construction that provides a garbage collection mechanism for old messages that never violates consistency even when there is no bound on the relative transmission delays.
Fichier principal
Vignette du fichier
rr.pdf (305.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03813789 , version 1 (13-10-2022)

Identifiants

  • HAL Id : hal-03813789 , version 1

Citer

Grégoire Bonin, Achour Mostefaoui, Matthieu Perrin, Olivier Ruas. Complexity of Update Consistent Universal Constructions. 2022. ⟨hal-03813789⟩
45 Consultations
19 Téléchargements

Partager

Gmail Facebook X LinkedIn More