Atomic Register Abstractions for Byzantine-Prone Distributed Systems, Extended Version - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2023

Atomic Register Abstractions for Byzantine-Prone Distributed Systems, Extended Version

Résumé

The construction of the atomic register abstraction over crash-prone asynchronous messagepassing systems has been extensively studied since the founding work of Attiya, Bar-Noy, and Dolev. It has been shown that t < n/2 (where t is the maximal number of processes that may be faulty) is a necessary and sufficient requirement to build an atomic register. However, little attention has been paid to systems where faulty processes may exhibit a Byzantine behavior. This paper studies three definitions of linearizable single-writer multi-reader registers encountered in the state of the art: Read/Write registers whose read operations return the last written value, Read/Write-Increment registers whose read operations return both the last written value and the number of previously written values, and Read/Append registers whose read operations return the sequence of all previously written values. More specifically, it compares their computing power and the necessary and sufficient conditions on the maximum ratio t/n which makes it possible to build reductions from one register to another. Namely, we prove that t < n/3 is necessary and sufficient to implement a Read/Write-Increment register from Read/Write registers whereas this bound is only t < n/2 for a reduction from a Read/Append register to Read/Write-Increment registers. Reduction algorithms meeting these bounds are also provided.
Fichier principal
Vignette du fichier
Atomic_Register_Abstractions_for_Byzantine_Prone_Distributed_Systems_Extended_Version.pdf (402.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04213718 , version 1 (21-09-2023)

Identifiants

  • HAL Id : hal-04213718 , version 1

Citer

Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin. Atomic Register Abstractions for Byzantine-Prone Distributed Systems, Extended Version. 2023. ⟨hal-04213718⟩
15 Consultations
97 Téléchargements

Partager

Gmail Facebook X LinkedIn More