Chandra–Toueg consensus algorithm: Difference between revisions

Revision as of 18:48, 14 January 2019

Revision as of 18:49, 14 January 2019

Line 18:

The consensus problem requires:

# termination: (all processes decide); on a value;

# validityagreement: (all processes decide on athe value that was some process's inputsame value); and

# agreementvalidity: (all processes decide on the samea value). that was some process's input value;

Before arguing that the algorithm above satisfies the 3 properties above, we recall the definition of an ''eventually strong failure detector''. An eventually strong failure detector is one that ''never'' identifies ''some'' specific non-faulty (or correct) process as having failed, after some initial period of confusion, and, at the same time, eventually identifies ''all'' faulty processes as failed.