Next Article in Journal
Energy Management in Industrial Plants
Article

Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems

School of Engineering, University of Aberdeen, Aberdeen, AB24 3UE, Scotland, UK
*
Author to whom correspondence should be addressed.
Computers 2012, 1(1), 3-23; https://doi.org/10.3390/computers1010003
Received: 6 April 2012 / Revised: 19 May 2012 / Accepted: 5 June 2012 / Published: 25 June 2012
In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieved by introducing node sets and tie breaker time. The latter provides a possible solution to simultaneous elections initiated by different nodes. In comparison with the classical algorithm and its existing modifications, this proposal generates minimum messages, stops redundant elections, and maintains fault-tolerant behaviour of the system.
Keywords: leader node election; distributed systems; bully algorithm
leader node election; distributed systems; bully algorithm
MDPI and ACS Style

Murshed, M.G.; Allen, A.R. Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems. Computers 2012, 1, 3-23. https://doi.org/10.3390/computers1010003

AMA Style

Murshed MG, Allen AR. Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems. Computers. 2012; 1(1):3-23. https://doi.org/10.3390/computers1010003

Chicago/Turabian Style

Murshed, Md. Golam, and Alastair R. Allen. 2012. "Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems" Computers 1, no. 1: 3-23. https://doi.org/10.3390/computers1010003

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop