Bounds on the time to reach agreement in the presence of timing uncertainty
From MaRDI portal
Publication:4299298
DOI10.1145/174644.174649zbMath0807.68042MaRDI 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
time complexity; distributed consensus; distributed network; distributed agreement; agreement algorithm; timing uncertainty
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
Efficiency of semisynchronous versus asynchronous networks, Hundreds of impossibility results for distributed computing, Randomized protocols for asynchronous consensus, The topology of distributed adversaries, The asynchronous bounded-cycle model, Timing conditions for linearizability in uniform counting networks, Wait-free Byzantine consensus., The Theta-Model: achieving synchrony without clocks, Structured Derivation of Semi-Synchronous Algorithms