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

Leader Election using Modified Heap Tree Method

International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 50 - Number 9
Year of Publication: 2012
Dinesh Kumar Yadav
C. S. Lamba
Shweta Shukla

Dinesh Kumar Yadav, C.s.lamba and Shweta Shukla. Article: Leader Election using Modified Heap Tree Method. International Journal of Computer Applications 50(9):5-10, July 2012. Full text available. BibTeX

	author = {Dinesh Kumar Yadav and C.s.lamba and Shweta Shukla},
	title = {Article: Leader Election using Modified Heap Tree Method},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {50},
	number = {9},
	pages = {5-10},
	month = {July},
	note = {Full text available}


In distributed system field, there are many challenges, and one of them is leader election. It is really tough task to find suitable and efficient algorithms for leader election. The main role of an elected leader is that it performs a centralized coordination after being selected and manages the use of a shared resource in an optimal manner. Whenever a failure occurs the new leader is elected by nodes using various algorithms so that nodes can continue working. In this paper, the proposal is a new approach, the improved heap tree mechanism for electing the coordinator. The higher efficiency and better performance in the presented algorithms with respect to the existing algorithms is validated through results


  • Princy Francis and Sanjeev Saxena ,IEEE conference ,1998,Optimal Distributed Leader Election Algorithm For Synchronous complete Network.
  • H. Gracia-Molina, IEEE Trans. on Computers, vol. C-31, no. 1, Jan. 1982 "Elections in a distributed computing system"
  • Mohammad Reza EffatParvar , Nasser Yazdani, Mehdi EffatParvar , Aresh Dadlani and Ahmad Khonsari,IEEE conference,2010, Improved Algorithms for Leader Election in Distributed Systems .
  • E. Korach, S. Moran, and S. Zaks, in Proc. 3rd ACM Symp. on Principles of Distributed Computing, Vancouver, Canada, pp. 199-207,Aug. 1984, "Tight lower and upper bounds for some distributed algorithms for a complete network of processors".
  • P. M. B. Vitanyi, "Distributed election in an Archimedean ring of processors", USA, pp. 542-547, 1984,in Proc. 16th ACM Symp. on Theory of Computing, Washington.
  • N. Fredrickson and N. Lynch,Journal of ACM, vol. 34, no. 1, pp. 98-115", 1987 "Electing a leader in a synchronous ring"
  • E. Chang and R. Roberts, Communications of the ACM, vol. 22, no. 5, pp. 281-283, May 1979 "An improved algorithm for decentralized extrema-finding in circular configurations of processes".
  • G. L. Peterson, ACM Trans. Programming Languages and Systems, pp. 758-762, Oct. 1982 "An O(n log n) unidirectional algorithm for the circular extrema problem".
  • G. LeLann, Information Processing Letters, pp. 155-160, 1977 "Distributed systems - towards a formal approach".
  • W. R. Franklin, Communication of the ACM, pp. 336-337, 1982 "On an improved algorithm for decentralized extrema finding in circular configurations of processors".
  • Xio Dong Wang, Ying Jie Wu, Journal of Computer Science and Technology. 22(6): 898-903 An improved heap sort algorithm with nlogn –0. 788928n comparisons in worst case.
  • Vandana Sharma, Parvinder S. Sandhu, Satwinder Singh, and Baljit Saini, World Academy of Science, Engineering and Technology 42, 2008,Analysis of Modified Heap Sort Algorithm on Different Environment.
  • Gonnet G H, Munro J I, 1986, 15(6): 964-971, Heaps on Heaps. SIAM Journal on Computing.
  • McDiarmid C J H, Journal of Algorithms, 1989, 10(3): 352~365,Reed B A. Building Heaps Fast.