TY - GEN
T1 - REACHING APPROXIMATTE AGREEMENT IN THE PRESENCE OF FAULTS.
AU - Dolev, Danny
AU - Lynch, Nancy A.
AU - Pinter, Shlomit S.
AU - Stark, Eugene W.
AU - Weihl, William E.
PY - 1983
Y1 - 1983
N2 - This paper considers a variant on 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, Lynch, and Paterson, which shows that exact agreement is not attainable in an asynchronous system with as few as one faulty process.
AB - This paper considers a variant on 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, Lynch, and Paterson, which shows that exact agreement is not attainable in an asynchronous system with as few as one faulty process.
UR - http://www.scopus.com/inward/record.url?scp=0020950238&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0020950238
SN - 0818605014
T3 - Proceedings - Symposium on Reliability in Distributed Software and Database Systems
SP - 145
EP - 154
BT - Proceedings - Symposium on Reliability in Distributed Software and Database Systems
PB - IEEE
ER -