Quick atomic broadcast

Piotr Berman, Anupam A. Bharali

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations


    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. We offer a technique that allows to convert “early stopping” Distributed Consensus protocols to Atomic Broadcast protocols with the above property. The resulting Atomic Broadcast protocols are faster and use smaller messages than the protocols proposed so far.

    Original languageEnglish (US)
    Title of host publicationDistributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings
    EditorsAndre Schipe
    PublisherSpringer Verlag
    Number of pages15
    ISBN (Print)9783540572718
    StatePublished - 1993
    Event7th International Workshop on Distributed Algorithms, WDAG 1993 - Lausanne, Switzerland
    Duration: Sep 27 1993Sep 29 1993

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume725 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Other7th International Workshop on Distributed Algorithms, WDAG 1993

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'Quick atomic broadcast'. Together they form a unique fingerprint.

    Cite this