α-register

Abstract : 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 .
Type de document :
Pré-publication, Document de travail
2013
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00863060
Contributeur : Corentin Travers <>
Soumis le : vendredi 20 septembre 2013 - 19:18:38
Dernière modification le : jeudi 11 janvier 2018 - 06:20:17
Document(s) archivé(s) le : vendredi 7 avril 2017 - 00:49:42

Fichier

alphareg-longversion.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00863060, version 2

Collections

Citation

David Bonnin, Corentin Travers. α-register. 2013. 〈hal-00863060v2〉

Partager

Métriques

Consultations de la notice

352

Téléchargements de fichiers

59