Perfect Failure Detection with Very Few Bits - Archive ouverte HAL Access content directly
Conference Papers Year :

Perfect Failure Detection with Very Few Bits

(1, 2) , (3) , (4) , (5) , (5)
1
2
3
4
5
Pierre Fraigniaud
• Function : Author
• PersonId : 955617
Sergio Rajsbaum
• Function : Author
• PersonId : 830510
Corentin Travers
• Function : Author
• PersonId : 879429
Petr Kuznetsov
Thibault Rieutord
• Function : Author

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.

Dates and versions

hal-01423637 , version 1 (30-12-2016)

Identifiers

• HAL Id : hal-01423637 , version 1

Cite

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⟩

119 View