• Submit to Computers Login Register
• MDPI
• Journals A-Z
• For Authors
• For Editors
• About
• Open Access Policy

• Abstract
• Full-Text PDF [455 KB]

• Article Statistics
• Google Scholar
• Order Reprints

• Cite this article
• Export to BibTeX
• Export to EndNote

• [+] on DOAJ
• Murshed, M
• Allen, A
• [+] on Google Scholar
• Murshed, M
• Allen, A
• [+] on PubMed
• Murshed, M
• Allen, A

•  CiteULike
•  Facebook
•  Mendeley
•  Twitter

This article is

• freely available
• re-usable

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

Article

Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems

Md. Golam Murshed and Alastair R. Allen*

School of Engineering, University of Aberdeen, Aberdeen, AB24 3UE, Scotland, UK

* Author to whom correspondence should be addressed.

Received: 6 April 2012; in revised form: 19 May 2012 / Accepted: 5 June 2012 / Published: 25 June 2012

Download PDF Full-Text [455 KB, uploaded 25 June 2012 16:05 CEST]

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

Article Statistics

Cite This Article