Browse Prior Art Database

Failure Discovery Problem

IP.com Disclosure Number: IPCOM000122305D
Original Publication Date: 1991-Nov-01
Included in the Prior Art Database: 2005-Apr-04
Document File: 1 page(s) / 24K

Publishing Venue

IBM

Related People

Hadzilacos, V: AUTHOR [+2]

Abstract

Byzantine Agreement is the problem whereby all processes in a system have to agree on the same value, despite the presence of failures. Failure Discovery is a weaker version of the problem, whereby processes only have to agree on the same value if there are no failures. (No requirements are made if there are failures.) Described is a method for converting an algorithm that solves the Failure Discovery problem to one that solves the Byzantine Agreement problem, using no extra messages and minimal round overhead in runs where there are no failures.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 100% of the total text.

Failure Discovery Problem

      Byzantine Agreement is the problem whereby all processes in a
system have to agree on the same value, despite the presence of
failures.  Failure Discovery is a weaker version of the problem,
whereby processes only have to agree on the same value if there are
no failures.  (No requirements are made if there are failures.)
Described is a method for converting an algorithm that solves the
Failure Discovery problem to one that solves the Byzantine Agreement
problem, using no extra messages and minimal round overhead in runs
where there are no failures.

      Disclosed anonymously.