Improved algorithms for leader election in distributed systems

Mohammad Reza Effat Parvar, Nasser Yazdani, Mehdi EffatParvar, Aresh Dadlani, Ahmad Khonsari

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

An important challenge confronted in distributed systems is the adoption of suitable and efficient algorithms for coordinator election. The main role of an elected coordinator is to manage the use of a shared resource in an optimal manner. Among all the algorithms reported in the literature, the Bully and Ring algorithms have gained more popularity. In this paper, we describe novel approaches towards improving the Bully and Ring algorithms and also propose the heap tree mechanism for electing the coordinator. The higher efficiency and better performance of our presented algorithms with respect to the existing algorithms is validated through extensive simulation results.

Original languageEnglish
Title of host publicationICCET 2010 - 2010 International Conference on Computer Engineering and Technology, Proceedings
PagesV26-V210
Volume2
DOIs
Publication statusPublished - Oct 25 2010
Externally publishedYes
Event2010 2nd International Conference on Computer Engineering and Technology, ICCET 2010 - Chengdu, China
Duration: Apr 16 2010Apr 18 2010

Publication series

NameICCET 2010 - 2010 International Conference on Computer Engineering and Technology, Proceedings
Volume2

Conference

Conference2010 2nd International Conference on Computer Engineering and Technology, ICCET 2010
CountryChina
CityChengdu
Period4/16/104/18/10

ASJC Scopus subject areas

  • Computer Science(all)

Cite this