The week's pick
Random Articles
Reseach Article
Optimized Bully Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 121 - Number 18 |
| Year of Publication: 2015 |
| Authors: Sathesh B.m |
10.5120/21641-4971
|
Sathesh B.m . Optimized Bully Algorithm. International Journal of Computer Applications. 121, 18 ( July 2015), 23-27. DOI=10.5120/21641-4971
Abstract
All distributed systems require one process to act as a coordinator , initiator or otherwise perform some special role . In general , it does not matter which process takes on this special responsibility , but one of them has to do it . The goal of an election algorithm is to ensure that when an election starts, it concludes with all processes agreeing on who the new coordinator is to be. Bully Algorithm by Garcia-Molina is a classic algorithm for leader election in a distributed system. Although the already existing algorithm solves the purpose, the traditional bully algorithm takes lot of message passing involved and it does not provide facilities to ensure that what will happen when dead leader recovers back again. Here we propose a slight modification in the classic bully algorithm which reduces the number of messages that are needed to elect the leader. Also we suggest methods on how to react when the dead leader recovers back again. The end result is a modified election bully algorithm which is much efficient than the existing leader election algorithms used in a distributed environment.
References
- Arghavani . A E. Ahmadi A. T. Haghighat Improved Bully Election Algorithm in Distributed Systems
- Fredrickson . N and Lynch . N. , 1 9 8 7 . Electing a Leader in a Synchronous Ring. " J. ACM, vol. 34, no. 1, pp. 98-115.
- Garcia-Molina, H. , "Elections in Distributed Computing System," IEEE Transaction Computers, Vol. C-1,pp. 48-59,Jan. 1982.
- Kim, J. L. and Belford, Geneva G. , 1988. A robust, distributed election protocol", Proc. of seventh IEEE Computer Soc. Symp. Reliable Distributed Systems, pp. 54-60, Columbus, Ohio.
- Le Lann, G. , "Distributed Systems – Towards a Formal Approach", in Information Processing 77, B. Gilchrist, Ed. Amsterdam, The Netherlands: North- Holland, pp. 155-160, 1977.
- Park S , Y. Kim and Hwang J. S. , 1999. An Efficient Algorithm for Leader-Election in Synchronous Distributed Systems, IEEE TENCON
- Renu Nekkanti and Aruna Kumari G. L. ELECTION ALGORITHM WHEN CRASH LEADER RECOVERS IN DISTRIBUTED SYSTEMS
- Singh, S. , Kurose, J. F. , "Electing 'good' leaders (election leader algorithm)," Journal of Parallel and Distributed Computing, Vol. 21, No. 2, pp. 184-201. May 1994.
- Sung-Hoon-Park, Yoon Kim, And Jeoung Sun Hwang "An Efficient Algorithm for Leader-Election in Synchronous Distributed Systems. " IEEE Transaction on Computers, vol. 43, no. 7, pp. 1991- 1994, 1999.
- Tanenbaum, A. S. , and Steen M. V. : "Distributed Systems Principles and Paradigms," Prentice-Hall International, Inc, 2002.
Index Terms
Keywords