Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...


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 .
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Corentin Travers Connect in order to contact the contributor
Submitted on : Friday, September 20, 2013 - 7:18:38 PM
Last modification on : Saturday, June 25, 2022 - 10:33:50 AM
Long-term archiving on: : Friday, April 7, 2017 - 12:49:42 AM


Files produced by the author(s)


  • HAL Id : hal-00863060, version 2



David Bonnin, Corentin Travers. α-register. 2013. ⟨hal-00863060v2⟩



Record views


Files downloads