Modern operating systems
Journal of Parallel and Distributed Computing
Distributed systems (3rd ed.): concepts and design
Distributed systems (3rd ed.): concepts and design
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Group leader election under link-state routing
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
A leader election algorithm in a distributed computing system
FTDCS '95 Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems
Elections in a Distributed Computing System
IEEE Transactions on Computers
| Hi-index | 0.00 |
Many of software in distributed systems require a special process called the coordinator or the leader. The coordinator is elected among the processes participating a particular distributed service when the service begins operation or the existing coordinator fails. The procedure of selecting the coordinator is called the election. One of the most popular election algorithms is the bully algorithm. However, this algorithm is costly because it generates O(n2) messages for n processes. Also the time delay till the completion of the election is considerably long. This paper proposes a new election algorithm called the fast bully algorithm. The algorithm is described and performance of the algorithm has been analyzed. The fast bully algorithm shows a clear performance improvement. It works with less messages, O(n) messages, and with shorter time delay than the bully algorithm. Also the problem of having two coordinators at the same time that appears by the bully algorithm can be avoided by the FBA.