Consensus in One Communication Step

  • Francisco Brasileiro
  • Fabíola Greve
  • Achour Mostefaoui
  • Michel Raynal
Conference paper

DOI: 10.1007/3-540-44743-1_4

Volume 2127 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Keywords

Asynchronous Distributed System Consensus Crash Failure Message Passing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Francisco Brasileiro
    • 1
  • Fabíola Greve
    • 1
  • Achour Mostefaoui
    • 1
  • Michel Raynal
    • 1
  1. 1.IRISA, Université de Rennes 1RennesFrance