Computers 2012, 1(1), 3-23; doi:10.3390/computers1010003
Article

Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems

email and * email
Received: 6 April 2012; in revised form: 19 May 2012 / Accepted: 5 June 2012 / Published: 25 June 2012
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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
PDF Full-text Download PDF Full-Text [455 KB, uploaded 25 June 2012 16:05 CEST]

Export to BibTeX |
EndNote


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.

AMA Style

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

Chicago/Turabian Style

Murshed, Md. Golam; Allen, Alastair R. 2012. "Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems." Computers 1, no. 1: 3-23.

Computers EISSN 2073-431X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert