Talk · International Conference on Computer Engineering and Technology · January 1, 2010
Improved algorithms for leader election in distributed systems
MohammadReza EffatParvar, Nasser Yazdani, Mehdi Effatparvar, Aresh Dadlani, Ahmad Khonsari
Abstract
An important challenge confronted in distributed systems is the adoption of suitable and 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. In this paper, we describe novel approaches towards improving the Bully and Ring algorithms and also propose the heap tree mechanism for electing the coordinator. The higher efficiency and better performance of our presented algorithms with respect to the existing algorithms is validated through extensive simulation results.
More by Aresh Dadlani
- Joint Freshness and Age-Dispersion Control over Finite-State Markov Wireless ChannelsarXiv · 2026
- Dynamic Link Prediction with Temporally Enhanced Signed Graph Neural NetworksarXiv · 2026
- DeepIrrigo: Deep Reinforcement Learning for Continuous and Discrete Action Irrigation Optimization--A Case Study in IranSSRN Electronic Journal · 2026
- Age Performance Analysis in Resource-Constrained Adversarial IoT SystemsarXiv · 2025