Bounds on the time to reach agreement in the presence of timing uncertainty

DOI10.1145/174644.174649zbMath0807.68042OpenAlexW2015781492MaRDI QIDQ4299298

Cynthia Dwork, Hagit Attiya, Larry J. Stockmeyer, Nancy A. Lynch

Publication date: 29 June 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/174644.174649

zbMATH Keywords

time complexitydistributed consensusdistributed networkdistributed agreementagreement algorithmtiming uncertainty

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (10)

The Theta-Model: achieving synchrony without clocks ⋮ The topology of distributed adversaries ⋮ Efficiency of semisynchronous versus asynchronous networks ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ The asynchronous bounded-cycle model ⋮ Structured Derivation of Semi-Synchronous Algorithms ⋮ Timing conditions for linearizability in uniform counting networks ⋮ Wait-free Byzantine consensus.

This page was built for publication: Bounds on the time to reach agreement in the presence of timing uncertainty