Quick Atomic Broadcast (Extended Abstract)

In Atomic Broadcast protocols, the participating processors may initiate the broadcast of a message at any time; the goal is to make all non-faulty processors deliver the same set of messages in the same order. Our objective in this paper is to assure that the delivery time (from the moment of initiation of a message to its last delivery by a correct processor) is proportional to the actual number of faults in a given run of the protocol. We study this problem in synchronous systems and two models of semi-synchronous systems in presence of various classes of processor failures.

[1]  Danny Dolev,et al.  'Eventual' is earlier than 'immediate' , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[3]  Stephen Ponzio.  Consensus in the presence of timing uncertainty: omission and Byzantine failures (extended abstract) , 1991, PODC '91.

[4]  Nancy A. Lynch,et al.  Bounds on the time to reach agreement in the presence of timing uncertainty , 1991, STOC '91.

[5]  Piotr Berman,et al.  Distributed consensus in semi-synchronous systems , 1992, Proceedings Sixth International Parallel Processing Symposium.

[6]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[7]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[8]  Piotr Berman,et al.  Optimal Early Stopping in Distributed Consensus (Extended Abstract) , 1992, WDAG.

[9]  Flaviu Cristian,et al.  Early-delivery atomic broadcast , 1990, PODC '90.

[10]  Flaviu Cristian,et al.  New latency bounds for atomic broadcast , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[11]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[12]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[13]  Ajei Sarat Gopal.  Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination , 1992 .

[14]  A. A. Bharali,et al.  Distributed consensus with general omission failures and timing uncertainty , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[15]  Sam Toueg,et al.  Early-Stopping Distributed Bidding and Applications (Preliminary Version) , 1990, WDAG.

[16]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[17]  Silvio Micali,et al.  Optimal algorithms for Byzantine agreement , 1988, STOC '88.