We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
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

A Comparative Analysis of Election Algorithm in Distributed Systems

Published on October 2011 by Heta Jasmin Jhaveri, Sanjay Shah
journal_cover_thumbnail

IP Multimedia Communications
Foundation of Computer Science USA
IPMC - Number 1
October 2011
Authors: Heta Jasmin Jhaveri, Sanjay Shah
30a19254-f58a-4495-859c-f3049f7e6cb4

Heta Jasmin Jhaveri, Sanjay Shah . A Comparative Analysis of Election Algorithm in Distributed Systems. IP Multimedia Communications. IPMC, 1 (October 2011), 84-87.

@article{
author = { Heta Jasmin Jhaveri, Sanjay Shah },
title = { A Comparative Analysis of Election Algorithm in Distributed Systems },
journal = { IP Multimedia Communications },
issue_date = { October 2011 },
volume = { IPMC },
number = { 1 },
month = { October },
year = { 2011 },
issn = 0975-8887,
pages = { 84-87 },
numpages = 4,
url = { /specialissues/ipmc/number1/3755-ipmc019/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 IP Multimedia Communications
%A Heta Jasmin Jhaveri
%A Sanjay Shah
%T A Comparative Analysis of Election Algorithm in Distributed Systems
%J IP Multimedia Communications
%@ 0975-8887
%V IPMC
%N 1
%P 84-87
%D 2011
%I International Journal of Computer Applications
Abstract

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.

References
  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.
Index Terms

Computer Science
Information Sciences

Keywords

Election Coordinator Priority Status table