Skip to Main content Skip to Navigation

Anonymity-Preserving Failure Detectors

Abstract : 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.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Corentin Travers <>
Submitted on : Monday, July 11, 2016 - 9:57:04 PM
Last modification on : Monday, December 14, 2020 - 3:34:04 PM


Files produced by the author(s)


  • HAL Id : hal-01344446, version 1



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



Record views


Files downloads