Exercise 23: show how to solve consensus in a synchronous distributed system with at most f crash failures

[dag7dev]

Exercise 23: Show how to solve consensus in a synchronous distributed system with at most f crash failures.

[susannacifani]

Here's the solution:

[Tommaso-Sgroi]

To solve consensus in a synchronous distributed system with at most $f$ crash failures and $n$ nodes, each process maintains a set $V$ of values proposed by other processes. Initially, the set contains only the process's value, but then it's updated.
In each round, a process sends to all other processes the values from $V$ that it has not sent before. After $f+1$ rounds, each process decides on the minimum value in $V$.

TOOK FROM: https://cnitarot.github.io/courses/ds_Fall_2016/505_consensus.pdf [page 11]
https://cnitarot.github.io/courses/ds_Fall_2016/index.html#lectures