The week's pick
Random Articles
Reseach Article
A Comparative Analysis of Election Algorithm in Distributed Systems
| 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.
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
- Sinha P.K, Distributed Operating Systems Concepts and Design, Prentice-Hall of India private Limited, 2008.
- Tanenbaum A.S Distributed Operating System, Pearson Education, 2007.
- Garcia – Molina “Elections in a distributed computing system”, IEEE transactions on computers, vol C-31, No 1,pp 48-59., 1982.
- Fredrickson and Lynch, Fredrickson, and Lynch, “Electing a Leader in a synchronous Ring”, journal of the ACM, Vol 34, pp 98-115, 1987.
- 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
Keywords