Distributed Computing

, Volume 1, Issue 1, pp 26–39

Easy impossibility proofs for distributed consensus problems

  • Michael J. Fischer
  • Nancy A. Lynch
  • Michael Merritt
Article

DOI: 10.1007/BF01843568

Cite this article as:
Fischer, M.J., Lynch, N.A. & Merritt, M. Distrib Comput (1986) 1: 26. doi:10.1007/BF01843568

Abstract

Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in certain communication graphs.

It is shown that, in the presence ofm faults, no solution to these problems exists for communication graphs with fewer than 3m+1 nodes or less than 2m+1 connectivity. While some of these results had previously been proved, the new proofs are much simpler, provide considerably more insight, apply to more general models of computation, and (particularly in the case of clock synchronization) significantly strengthen the results.

Key words

Agreement Distributed computing Fault tolerance 

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Michael J. Fischer
    • 1
  • Nancy A. Lynch
    • 2
  • Michael Merritt
    • 3
    • 4
  1. 1.Department of Computer ScienceYale UniversityNew HavenUSA
  2. 2.Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridgeUSA
  3. 3.AT & T Bell LaboratoriesMurray HillUSA
  4. 4.Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations