Modified bully election algorithm in distributed systems

Authors:
M. S. Kordafshari;M. Gholipour;M. Mosakhani;A. T. Haghighat;M. Dehghan
Affiliations:
Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran;Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran;Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran;Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran;Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran
Venue:
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Year:
2005

Citing 3
Cited 0

Electing a leader in a synchronous ring

Journal of the ACM (JACM)
Electing “good” leaders

Journal of Parallel and Distributed Computing
Leader Election in the Presence of Link Failures

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Leader election is a fundamental problem in distributed computing, and regards a wide number of applications. In order to solve this problem, it is possible and convenient to exploit the topological properties of the specific distributed systems, so to reduce time and message complexity. In this paper we explain Garcia Molina's bully algorithm and indicate the problem of this algorithm and modify the bully algorithm. We show that modify algorithm is more efficient than the Garcia Molina's one in the time, message complexity and in the fewer stages.