We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Improved bully election algorithm in distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Arghavani, A. ; Comput. & IT Dept., Islamic Azad Univ., Qazvin, Iran ; Ahmadi, E. ; Haghighat, A.T.

In centralized algorithm for mutual exclusion, one process is elected as a coordinator. Whenever a process wants to go to critical section, it sends a request message to the coordinator and asks for permission. The election of coordinator is an important problem in distributed systems. After a failure occurs in the system, it is necessary to reelect a new leader as a coordinator. The bully election algorithm is one of the classic methods which is used to determine the process with highest priority number as the coordinator. But this algorithm often needs a lot of message passing to find out which process should be a new coordinator. In this paper we are going to propose an optimized method for the bully algorithm called modified bully algorithm. Our analytical simulation shows that, our algorithm has fewer message passing and is more efficient.

Published in:

Information Technology and Multimedia (ICIM), 2011 International Conference on

Date of Conference:

14-16 Nov. 2011