Distributed consensus in semi-synchronous systems

Piotr Berman, Anupam A. Bharali

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

    3 Scopus citations

    Abstract

    The Distributed Consensus problem assumes that all processors in the system have some initial values; the goal is to make all non-faulty processors agree on one of these values. This paper investigates the time needed to reach consensus in a partially synchronous model with omission failures. In this model, the processors have no direct knowledge about time, but the time between consecutive steps of each processor is always between two known constants c1 and c2; the ratio C = c2/c1 measures the timing uncertainty in the system. Moreover, messages are delivered within time d. This paper provides an improved protocol for the above problem. When the majority of the processors is fault-free, the protocol achieves consensus in time 3(qq+1)d+Cd, where φ is the actual number of faults in a specific execution of the protocol. This will allow an increase in efficiency up to 25% over the existing protocol which requires time 4(qq+1)d+Cd.

    Original languageEnglish (US)
    Title of host publicationProceedings of the International Conference on Parallel Processing
    PublisherPubl by IEEE
    Pages632-635
    Number of pages4
    ISBN (Print)0818626720
    StatePublished - Dec 1 1992
    EventProceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA
    Duration: Mar 23 1992Mar 26 1992

    Publication series

    NameProceedings of the International Conference on Parallel Processing
    ISSN (Print)0190-3918

    Other

    OtherProceedings of the 6th International Parallel Processing Symposium
    CityBeverly Hills, CA, USA
    Period3/23/923/26/92

    All Science Journal Classification (ASJC) codes

    • Hardware and Architecture

    Cite this