Next Article in Journal
Energy Management in Industrial Plants
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Computers
Volume 1
Issue 1
10.3390/computers1010003
computers-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems

by
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.
Computers 2012, 1(1), 3-23; https://doi.org/10.3390/computers1010003
Submission received: 6 April 2012 / Revised: 19 May 2012 / Accepted: 5 June 2012 / Published: 25 June 2012

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
 leader node election; distributed systems; bully algorithm

Share and Cite

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

APA Style

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

Article Metrics

Back to TopTop