Consensus in One Communication Step
- Cite this paper as:
- Brasileiro F., Greve F., Mostefaoui A., Raynal M. (2001) Consensus in One Communication Step. In: Malyshkin V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg
This paper presents a very simple consensus protocol that converges in a single communication step in favorable circumstances. Those situations occur when “enough” processes propose the same value. (“Enough” means “at least (n - f)” where f is the maximum number of processes that can crash in a set of n processes). The protocol requires f < n/3. It is shown that this requirement is necessary. Moreover, if all the processes that propose a value do propose the same value, the protocol always terminates in one communication step. It is also shown that additional assumptions can help weaken the f < n/3 requirement to f < n/2.
KeywordsAsynchronous Distributed System Consensus Crash Failure Message Passing
Unable to display preview. Download preview PDF.