Randomized fault-detecting leader election in a bi-directional ring

Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip by sending it in both directions. The algorithm is fault-detecting in a strong sense: it works if and only if there is a connected segment of

• Type: Conference
• Year: 1990
• Where: SPDP
• Authors: N. R. Wagner
• Keywords: Distributed And Parallel Computing, Leader Election, Non-faulty Processor, Randomized Algorithm, SPDP 1990