Anonymity-Preserving Failure Detectors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2016

Anonymity-Preserving Failure Detectors


The paper investigates the consensus problem in anonymous, failures prone and asynchronous shared memory systems. It introduces a new class of failure detectors, called anonymity-preserving failures detectors suited to anonymous systems. As its name indicates, a failure detector in this class cannot be relied upon to break anonymity. For example, the anonymous perfect detector AP , which gives at each process an estimation of the number of processes that have failed belongs to this class. The paper then determines the weakest failure detector among this class for consensus. This failure detector, called C, may be seen as a loose failures counter: (1) after a failure occurs, the counter is eventually incremented, and (2) when at least two processes do not fail, it eventually stabilizes. Finally, the paper also introduces failure detector Ck , a simple generalization of C and shows that it can be used to solve k-set-agreement, a generalization of consensus in which up to k distinct values may be decided.
Fichier principal
Vignette du fichier
C-fullversion.pdf (383.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01344446 , version 1 (11-07-2016)


  • HAL Id : hal-01344446 , version 1


Zohir Bouzid, Corentin Corentin Travers. Anonymity-Preserving Failure Detectors. [Research Report] LaBRI - Laboratoire Bordelais de Recherche en Informatique. 2016. ⟨hal-01344446⟩


76 View
199 Download


Gmail Facebook X LinkedIn More