Reaching approximate agreement in the presence of faults

  • Authors:

  • Danny Dolev;Nancy A. Lynch;Shlomit S. Pinter;Eugene W. Stark;William E. Weihl

  • Affiliations:

  • Hebrew Univ., Jerusalem, Israel;Massachusetts Institute of Technology, Cambridge;Technion, Haifa, Israel;State Univ. of New York at Stony Brook, Stony Brook;Massachusetts Institute of Technology, Cambridge

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1986

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper considers a variant of the Byzantine Generals problem, in which processes start with arbitrary real values rather than Boolean values or values from some bounded range, and in which approximate, rather than exact, agreement is the desired goal. Algorithms are presented to reach approximate agreement in asynchronous, as well as synchronous systems. The asynchronous agreement algorithm is an interesting contrast to a result of Fischer et al, who show that exact agreement with guaranteed termination is not attainable in an asynchronous system with as few as one faulty process. The algorithms work by successive approximation, with a provable convergence rate that depends on the ratio between the number of faulty processes and the total number of processes. Lower bounds on the convergence rate for algorithms of this form are proved, and the algorithms presented are shown to be optimal.