Call for Paper - July 2022 Edition
IJCA solicits original research papers for the July 2022 Edition. Last date of manuscript submission is June 20, 2022. Read More

A Comparative Analysis of Election Algorithm in Distributed Systems

IP Multimedia Communications
© 2011 by IJCA Journal
ISBN : 978-93-80864-99-3
Year of Publication: 2011
Heta Jasmin Jhaveri
Sanjay Shah

Heta Jasmin Jhaveri and Sanjay Shah. A Comparative Analysis of Election Algorithm in Distributed Systems. Special issues on IP Multimedia Communications (1):84-87, October 2011. Full text available. BibTeX

	author = {Heta Jasmin Jhaveri and Sanjay Shah},
	title = {A Comparative Analysis of Election Algorithm in Distributed Systems},
	journal = {Special issues on IP Multimedia Communications},
	month = {October},
	year = {2011},
	number = {1},
	pages = {84-87},
	note = {Full text available}


In distributed system, an important challenge faced is the adoption of 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. This paper proposes a comparative analysis of the various election algorithms in distributed system and also presents a new approach for effective election.


  1. Sinha P.K, Distributed Operating Systems Concepts and Design, Prentice-Hall of India private Limited, 2008.
  2. Tanenbaum A.S Distributed Operating System, Pearson Education, 2007.
  3. Garcia – Molina “Elections in a distributed computing system”, IEEE transactions on computers, vol C-31, No 1,pp 48-59., 1982.
  4. Fredrickson and Lynch, Fredrickson, and Lynch, “Electing a Leader in a synchronous Ring”, journal of the ACM, Vol 34, pp 98-115, 1987.
  5. An Efficient Approach of Election Algorithm in Distributed Systems” - Sandipan Basu / Indian Journal of Computer Science and Engineering (IJCSE), Vol 20, No 1, 2010.