The week's pick
Random Articles
Reseach Article
An Efficient Overhead-aware Leader Election Algorithm for Distributed Systems
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 49 - Number 6 |
| Year of Publication: 2012 |
| Authors: Muneer Bani Yassein, Ala’a N. Alslaity, Sana’a A. Alwidian |
10.5120/7630-0699
|
Muneer Bani Yassein, Ala’a N. Alslaity, Sana’a A. Alwidian . An Efficient Overhead-aware Leader Election Algorithm for Distributed Systems. International Journal of Computer Applications. 49, 6 ( July 2012), 10-15. DOI=10.5120/7630-0699
Abstract
In the area of distributed computing, the leader election process is meant with selecting a single node as a leader or a coordinator for a particular task that is distributed among other members. In such environments, if the leader got crashed, all other nodes have to elect another leader. In the literature, many leader election algorithms have been proposed. Most popular is the Garcia Molina's Bully algorithm. In this paper, we propose a new leader election algorithm that is based on sending a lower number of messages to perform leader election. The results show that our proposed algorithm reduces the overhead associated with the classical Garcia's Bully algorithm and efficiently outperform it in terms of reducing latency and message complexity.
References
- Rebecca Ingram, Patrick Shields, Jennifer E. Walter and Jennifer L. "An Asynchronous Leader Election Algorithm for Dynamic Networks". IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel & Distributed Processing. pp. 1-12, 2009.
- Mehdi Mirakhorli, Amir AzimSharifloo, MaghsoudAbbaspour, "A Novel Method for Leader Election Algorithm," The 7th IEEE International Conference on Computer and Information Technology (CIT 2007), pp. 452-456, 2007.
- Mina Shirali, Abolfazl Haghighat Toroghi, Mehdi Vojdani, "Leader Election Algorithms: History and Novel Schemes". Third International Conference on Convergence and Hybrid Information Technology (ICCIT), vol. 1, pp. 1001-1006, 2008.
- H. Garcial Molina "Election in a distributed Computing System". IEEE Trans. Comp, 1982, vol31, no. 1, pp. 48-59. 1982
- N. Fredrickson and Lynch "Electing a Leader in a Synchronous Ring" ACM, , vol. 34 no. 1, pp. 98-115, 1987.
- M. Gholipour, M. S. Kordafshari, M. Jahanshahi, A. M. Rahmani, "A New Approach for Election Algorithm in Distributed Systems". The Second International Conference on Communication Theory, Reliability, and Quality of Service, pp. 70-74, 2009.
- M. S. Kordafshari, M. Gholipour, M. Jahanshahi, A. T. Haghighat "Modified bully election algorithm in distributed systems". CCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers, 2005
- Junqueira, F. , Reed, B. , Sera_ni, M. : Zab: High-performance broadcast for primary-backup systems. In: Proc. of the IEEE Int'l Conf. on Dependable Systems and Networks (DSN-DCCS), 2011.
- M. Gholipour, M. S. Kordafshari, M. Jahanshahi, A. M. Rahmani "A New Approach For Election Algorithm in Distributed Systems". 2009 Second International Conference on Communication Theory, Reliability, and Quality of Service, 2009
- Sung-Hoon Park "A Stable Election Protocol based on an Unreliable Failure Detector in Distributed Systems". 2011 Eighth International Conference on Information Technology: New Generations. pp. 979 – 984, April 2011
- Zargarnataj, M. "New Election Algorithm based on Assistant in Distributed Systems". IEEE/ACS International Conference on Computer Systems and Applications, 2007. AICCSA '07. pp. 324 – 331, May 2007.
Index Terms
Keywords