A simple proof of the uniform consensus synchronous lower bound. (Q1853174)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A simple proof of the uniform consensus synchronous lower bound.
scientific article

    Statements

    A simple proof of the uniform consensus synchronous lower bound. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    We give a simple and intuitive proof of an \(f+2\) round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating \(t\) failures, and for every \(f<t-2\), there is an execution with \(f\) failures that requires \(f+2\) rounds.
    0 references
    Distributed computing
    0 references
    Fault tolerance
    0 references
    Lower bounds
    0 references
    Consensus
    0 references

    Identifiers