Abstract
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(n 2) 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.
Hoon Choi was supported by the Korea Science and Engineering Foundation under the Grant 981-0925-134-2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
erences
G. Coulouris, J. Dollimore and T. Kindberg, Distributed Systems, Concepts and Design (3rd Ed.), Addison-Wesley, 2001.
H. Garcia-Molina, “Elections in a distributed computing system,” IEEE Trans. on Computers, vol. 31, no. 1, pp. 48–59, Jan. 1982.
E. G. Chang and R. Robert, “An improved algorithm for decentralized extreme-finding in circular configurations of processors,” Communications of ACM, vol. 22, no. 9, pp. 281–283, 1979.
A. S. Tanenbaum, Modern Operating Systems, Prentice Hall, 1992.
Christof Fetzer and Flaviu Cristian, “A Highly Available Local Leader Election Service,” Proc. of Dependable Computing and Fault Tolerant Systems, vol. 11, pp. 83–102, 1997.
Y, Huang and P.K. McKinley, “Group Leader Election under Link-State Routing,” Proc. of International Conference on Network Protocols, pp. 95–104, 1997.
Riccardo Gusella and Zatti Stefano, “An Election Algorithm for a Distributed Clock Synchronization Program,” Proc. of the 6th International Conference on Distributed Computing System, pp. 364–371, 1986.
T.W. Kim, E.H. Kim and T.Y. Kim, “A Leader Election Algorithm in a Distributed Computing System,” Proc. of the IEEE Computer Society Workshop in Future Trends of Distributed Computing System, pp. 481–487, 1995.
S. Singh and J. Kurose, “Electing ‘Good’ leaders,” Journal of Parallel and Distributed Computing, vol. 21, pp. 184–201, May 1994.
Andrei V. Borshchev, Yuri G. Karpov and Victor V. Rouadkov, “System Modeling, Simulation and Analysis Using COVERS Active Object, ” http://www.xjtek.com/reference/articles/monterey/index.html, 1997.
Hoon Choi, “An efficient algorithm for electing a coordinator process in distributed systems,” Journal of Korea Information Science Society, vol. 25, no 9, pp. 926–936, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, SH., Choi, H. (2002). The Fast Bully Algorithm: For Electing a Coordinator Process in Distributed Systems. In: Chong, I. (eds) Information Networking: Wireless Communications Technologies and Network Applications. ICOIN 2002. Lecture Notes in Computer Science, vol 2344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45801-8_58
Download citation
DOI: https://doi.org/10.1007/3-540-45801-8_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44255-4
Online ISBN: 978-3-540-45801-2
eBook Packages: Springer Book Archive