Skip to Main content Skip to Navigation

Perfect Failure Detection with Very Few Bits

Abstract : A failure detector is a distributed oracle that provides each process with a module that continuously outputs an estimate of which processes in the system have failed. The perfect failure detector provides accurate and eventually complete information about process failures. We show that, in asynchronous failure-prone message-passing systems, perfect failure detection can be achieved by an oracle that outputs at most ⌈log α(n)⌉ + 1 bits per process in n-process systems, where α denotes the inverse-Ackermann function. This result is essentially optimal, as we also show that, in the same environment, no failure detector outputting a constant number of bits per process can achieve perfect failure detection.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Corentin Travers Connect in order to contact the contributor
Submitted on : Tuesday, September 13, 2016 - 12:42:17 PM
Last modification on : Saturday, June 25, 2022 - 10:36:45 AM
Long-term archiving on: : Wednesday, December 14, 2016 - 1:19:21 PM


Files produced by the author(s)


  • HAL Id : hal-01365304, version 1


Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord. Perfect Failure Detection with Very Few Bits. [Research Report] LaBRI - Laboratoire Bordelais de Recherche en Informatique. 2016. ⟨hal-01365304⟩



Record views


Files downloads