Randomized leader election

DOI10.1007/s00446-007-0022-4zbMath1266.68222OpenAlexW2163823499MaRDI QIDQ1954216

Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2610&context=cstech

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (5)

Improved Tradeoffs for Leader Election ⋮ Leader election in well-connected graphs ⋮ Sublinear bounds for randomized leader election ⋮ Analysis of fully distributed splitting and naming probabilistic procedures and applications ⋮ Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications

Uses Software

• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Billiard quorums on the grid
• Estimating network size from local information
• Distributed match-making
• N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable
• Probabilistic quorum systems
• Locality in structured peer-to-peer networks
• On the minimal synchronism needed for distributed consensus
• Electing a leader in a synchronous ring
• Fastest Mixing Markov Chain on a Graph
• Randomized mutual exclusion algorithms revisited
• Choosing a random peer
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: Randomized leader election