- Authors:
- Tushar D Chandra,
- Vassos Hadzilacos,
- Sam Toueg
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In [CT91], we proved that $\Diamond\cal W$, a failure detector that provides surprisingly little information about which processes have crashed, is sufficient to solve Consensus in asynchronous systems with a majority of correct processes. In this paper, we prove that to solve Consensus, any failure detector has to provide at least as much information as $\Diamond\cal W$. Thus, $\Diamond\cal W$ is indeed the weakest failure detector for solving Consensus in asynchronous systems with a majority of correct processes.
Recommendations
The weakest failure detector for solving consensus
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [1996], it is shown that W, a failure detector that provides surprisingly ...
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
EurAsia-ICT '02: Proceedings of the First EurAsian Conference on Information and Communication TechnologyThis paper is about the weakest failure detector to solve the Election problem in asynchronous distributed systems. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with ...
Implementing the weakest failure detector for solving the consensus problem
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, such as the consensus problem. In this ...