α-Register - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

α-Register

Résumé

It is well known that in an asynchronous message-passing system, one can emulate an atomic register providing that more than half of the processes are non-faulty. By contrast, when a majority of the processes may fail, simulating atomic register is not possible. This paper investigates weak variants of atomic registers that can be simulated tolerating a majority of processes failures. Specifically, the paper introduces a new class of registers, called α-register and shows how to emulate them. For atomic registers, a read operation returns the last written value when there is no concurrent write operations. α-registers generalize atomic registers in the following sense: In any interval I, at most α values written before I are returned by the read operations in I. A simulation of an α-register tolerating f failures in a n-processes system is presented for α = 2M −1, where M = max(1, 2f −n+2). The simulation is optimal up to a constant multiplicative factor: the paper establishes that α-registers cannot be simulated tolerating f failures if α ≤ M .
Fichier principal
Vignette du fichier
16.pdf (199.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00992784 , version 1 (19-05-2014)

Identifiants

  • HAL Id : hal-00992784 , version 1

Citer

David Bonnin, Corentin Travers. α-Register. OPODIS, 2013, Unknown, pp.53-67. ⟨hal-00992784⟩
427 Consultations
100 Téléchargements

Partager

Gmail Facebook X LinkedIn More