Skip to Main content Skip to Navigation
Conference papers

Perfect Failure Detection with Very Few Bits

Abstract : A \emph{failure detector} is a distributed oracle that provides the processes with information about failures. The \emph{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 $\lceil \log \alpha(n)\rceil+1$ bits per process in $n$-process systems, where $\alpha$ denotes the inverse-Ackermann function. This result is essentially optimal, as we also show that, in the same environment, no failure detectors outputting a constant number of bit per process can achieve perfect failure detection.
Complete list of metadata

https://hal.inria.fr/hal-01423637
Contributor : Pierre Fraigniaud Connect in order to contact the contributor
Submitted on : Friday, December 30, 2016 - 5:52:29 PM
Last modification on : Friday, January 21, 2022 - 3:19:51 AM

Identifiers

  • HAL Id : hal-01423637, version 1

Citation

Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord. Perfect Failure Detection with Very Few Bits. 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, Lyon, France. ⟨hal-01423637⟩

Share

Metrics

Les métriques sont temporairement indisponibles