CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Leader Election using Modified Heap Tree Method

by Dinesh Kumar Yadav, C.s.lamba, Shweta Shukla
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 50 - Number 9
Year of Publication: 2012
Authors: Dinesh Kumar Yadav, C.s.lamba, Shweta Shukla
10.5120/7797-0913

Dinesh Kumar Yadav, C.s.lamba, Shweta Shukla . Leader Election using Modified Heap Tree Method. International Journal of Computer Applications. 50, 9 ( July 2012), 5-10. DOI=10.5120/7797-0913

@article{ 10.5120/7797-0913,
author = { Dinesh Kumar Yadav, C.s.lamba, Shweta Shukla },
title = { Leader Election using Modified Heap Tree Method },
journal = { International Journal of Computer Applications },
issue_date = { July 2012 },
volume = { 50 },
number = { 9 },
month = { July },
year = { 2012 },
issn = { 0975-8887 },
pages = { 5-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume50/number9/7797-0913/ },
doi = { 10.5120/7797-0913 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:47:49.764470+05:30
%A Dinesh Kumar Yadav
%A C.s.lamba
%A Shweta Shukla
%T Leader Election using Modified Heap Tree Method
%J International Journal of Computer Applications
%@ 0975-8887
%V 50
%N 9
%P 5-10
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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

References
  1. Princy Francis and Sanjeev Saxena ,IEEE conference ,1998,Optimal Distributed Leader Election Algorithm For Synchronous complete Network.
  2. H. Gracia-Molina, IEEE Trans. on Computers, vol. C-31, no. 1, Jan. 1982 "Elections in a distributed computing system"
  3. Mohammad Reza EffatParvar , Nasser Yazdani, Mehdi EffatParvar , Aresh Dadlani and Ahmad Khonsari,IEEE conference,2010, Improved Algorithms for Leader Election in Distributed Systems .
  4. 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".
  5. 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.
  6. N. Fredrickson and N. Lynch,Journal of ACM, vol. 34, no. 1, pp. 98-115", 1987 "Electing a leader in a synchronous ring"
  7. 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".
  8. 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".
  9. G. LeLann, Information Processing Letters, pp. 155-160, 1977 "Distributed systems - towards a formal approach".
  10. W. R. Franklin, Communication of the ACM, pp. 336-337, 1982 "On an improved algorithm for decentralized extrema finding in circular configurations of processors".
  11. 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.
  12. 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.
  13. Gonnet G H, Munro J I, 1986, 15(6): 964-971, Heaps on Heaps. SIAM Journal on Computing.
  14. McDiarmid C J H, Journal of Algorithms, 1989, 10(3): 352~365,Reed B A. Building Heaps Fast.
Index Terms

Computer Science
Information Sciences

Keywords

Modified Heap tree Modified Heap tree method

Powered by PhDFocusTM