Content deleted Content added
mNo edit summary |
m Dating maintenance tags: {{Referencing}} {{Tone}} |
||
Line 1:
{{referencing|date=October 2011}}{{tone|date=October 2011}}The '''Chandra–Toueg consensus algorithm''' 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 good process as having crashed after some initial period of confusion, and at the same time eventually identifies all bad processes as crashed. The algorithm itself is similar to the [[Paxos algorithm]], which also relies on failure detectors. Both algorithms assume the number of faulty processes is less than n/2, where n is the total number of processes.
== The algorithm ==
| |||