Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
DOI10.1137/0220023zbMATH Open0722.68006OpenAlexW1974895073MaRDI QIDQ3210138FDOQ3210138
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220023
Recommendations
- scientific article; zbMATH DE number 1759418
- Communication and time complexity of a distributed election protocol
- Election in asynchronous complete networks with intermittent link failures
- Message lower bounds via efficient network synchronization
- Message Lower Bounds via Efficient Network Synchronization
- The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
- Time-message trade-offs in distributed algorithms
- Message and time efficient consensus protocols for synchronous distributed systems
- Lower bounds to processor-time tradeoffs under bounded-speed message propagation
distributed algorithmscomplete networksleader election algorithmstime-message complexities trade-off
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Cited In (18)
- Title not available (Why is that?)
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- Distributed election in complete networks
- Hundreds of impossibility results for distributed computing
- Title not available (Why is that?)
- Message lower bounds via efficient network synchronization
- Message Lower Bounds via Efficient Network Synchronization
- Improved deterministic leader election in diameter-two networks
- An improved algorithm for finding the median distributively
- Improved Tradeoffs for Leader Election
- Communication and time complexity of a distributed election protocol
- Design and analysis of dynamic leader election protocols in broadcast networks
- Singularly optimal randomized leader election
- On a game in directed graphs.
- The complexity of leader election in diameter-two networks
- Sublinear bounds for randomized leader election
- Communication efficient self-stabilizing leader election
- On the Complexity of Universal Leader Election
This page was built for publication: Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210138)
