The weakest failure detector to solve nonuniform consensus

Authors:
Jonathan Eisler;Vassos Hadzilacos;Sam Toueg
Affiliations:
University of Toronto;University of Toronto;University of Toronto
Venue:
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Year:
2005

Citing 3
Cited 2

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)

Optimal decision strategies in Byzantine environments

Journal of Parallel and Distributed Computing
Extracting quorum failure detectors

Proceedings of the 28th ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We determine the weakest failure detector to solve nonuniform consensus in any environment, i.e., regardless of the number of faulty processes. Together with previous results, this closes all aspects of the following question: What is the weakest failure detector to solve (uniform or nonuniform) consensus in any environment?