Computers in Control

Reaching agreement in multiprocessor systems after a restricted number of rounds of information interchange

Yu. L. Tomfield

Moscow

Abstract: The third round and the subsequent rounds of information exchange in the wellknown Byzantine generals algorithm are used for reaching agreement about some unreliable and then quite useless information only. Two more efficient algorithms are suggested for reaching agreement, a two-rounds one with full reciprocal testing processors with minimal restriction of the number of faulty processors and a three-rounds algorithm with partial reciprocal testing with a weaker restriction than for the Byzantine generals algorithm.

UDC: 681.324


Received: 08.01.1988

 English version: Automation and Remote Control, 1989, 50:9, 1296–1302

Bibliographic databases:

•