Content deleted Content added
No edit summary |
No edit summary |
||
Line 1:
The '''Chandra–Toueg consensus algorithm''', published by Tushar Deepak Chandra and Sam Toueg in 1996, is an algorithm for solving [[Consensus (computer science)|consensus]] in a network of unreliable processes equipped with an ''eventually strong'' [[failure detector]]. The failure detector is an abstract version of [[Timeout (computing)|timeouts]]; it signals to each process when other processes may have crashed. An eventually strong failure detector is one that never identifies ''some'' specific non-faulty process as having failed after some initial period of confusion, and, at the same time, eventually identifies ''all'' faulty processes as failed (where a faulty process is a process which eventually fails or crashes and a non-faulty process never fails). The algorithm itself is similar to the [[Paxos algorithm]], which also relies on failure detectors{{citation needed}}. Both algorithms assume the number of faulty processes, f, is less than n/2 (i.e. the minority), i.e. they assume f < n/2, where n is the total number of processes.
== The algorithm ==
| |||