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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Comparison of Various Election Algorithms in Distributed System

by Priyanka Gupta, Rajeev G. Vishwakarma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 53 - Number 12
Year of Publication: 2012
Authors: Priyanka Gupta, Rajeev G. Vishwakarma
10.5120/8470-2396

Priyanka Gupta, Rajeev G. Vishwakarma . Comparison of Various Election Algorithms in Distributed System. International Journal of Computer Applications. 53, 12 ( September 2012), 1-4. DOI=10.5120/8470-2396

@article{ 10.5120/8470-2396,
author = { Priyanka Gupta, Rajeev G. Vishwakarma },
title = { Comparison of Various Election Algorithms in Distributed System },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 53 },
number = { 12 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume53/number12/8470-2396/ },
doi = { 10.5120/8470-2396 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:53:53.678438+05:30
%A Priyanka Gupta
%A Rajeev G. Vishwakarma
%T Comparison of Various Election Algorithms in Distributed System
%J International Journal of Computer Applications
%@ 0975-8887
%V 53
%N 12
%P 1-4
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper present the comparison between the various available algorithms on the basis of their structure, assumptions and the main thing is complexity. We compare the algorithms with our proposed one. We take the message complexity of various algorithms from previous papers. And calculate the message complexity for our newly define approach, and compare the calculated complexity with all the available algorithms complexity. The result shows that our proposed approach is more efficient than the previous approaches also it has less no of message passing during communication.

References
  1. H. Garcia Molina, "Elections in a Distributed Computing System. " IEEE Trans. Comp, 1982, vol. 31.
  2. A. Arghavani,E. ahmadi,A. t. Haghihat"Improved Bully Election in Distributed System" Malaysia 2011
  3. N. Fredrickson and N. Lynch, "Electing a Leader in asynchronous Ring. " J. ACM, 1987, vol. 34
  4. Quazi Ehsanul Kabir Mamum,Salahuddin Mohammad Masum,Mohammad Abdur Rahim Mustafa"Modified Bully Algorithm for Electing Coordinator in Distributed System" Austria 2004
  5. G. Le Lann, "Distributed systems-Towards a formal approach," Information Processing 77, Amsterdam: North Holland, pp. 155-160, 1977.
  6. S. Park, Y. Kim and J. S. Hwang, "An Efficient Algorithm for Leader-Election in Synchronous Distributed Systems,"1999 IEEE TENCON.
  7. J. Brunekreef, J. -P. Katoen, R. Koymans, and S. Mauw,"Design and analysis of Dynamic leader election protocols in broadcast networks," Distributed Computing, vol. 9
  8. Tai Woo Kim , Eui Hong Kim, Joong Kwon Kim " A Leader Election Algorithm in a Distributed Computing System" IEEE 1995
  9. M. Gholipur, M. S. Kordafshri, M. Jahanshani, A. M. Rahmani " A New Approach For Election Algorithm in Distributed Systems"IEEE 2009
  10. Mohammad Reza Effat Parvar,Nasser Yazsani, Mehdi EddatParvar, Aresh Dadlani , and Ahmad khonsari " Improved Algorithms for Leader Electon in Sidtributed Systems" IEEE 2010
  11. M. Gholipur, M. S. Kordafshri, M. Jahanshani, A. M. Rahmani " Modified Bully Election Algorithm in Distributed Systems" 2005
  12. Mohammad Abdur Rahim, Afroza Nahar " Modified Bully Algorithms Using Election Commission "
  13. Paul Krzyzanowski " Process Synchronization and Election Algorithm " 2009
  14. Rebecca Ingram, Patrick Shields , jennifier L. Walter " An Aynchronous Leader Election Algorithm For Distributed Network" 2009
  15. S. Park, Y. Kim and J. S. Hwang, "An Efficient Algorithm for Leader-Election in Synchronous Distributed Systems,"1999 IEEE TENCON
Index Terms

Computer Science
Information Sciences

Keywords

Processes node Distributed System priority

Powered by PhDFocusTM