Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm

Authors:
M. S. Kordafshari;M. Gholipour;M. Jahanshahi;A. T. Haghighat
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;Atomic Energy Organization of Iran, Tehran, Iran
Venue:
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Year:
2005

Citing 16
Cited 0

Electing a leader in a synchronous ring

Journal of the ACM (JACM)
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Electing “good” leaders

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

IEEE Transactions on Parallel and Distributed Systems
A locking protocol for resource coordination in distributed databases

ACM Transactions on Database Systems (TODS)
Improvements in the time complexity of two message-optimal election algorithms

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
On an improved algorithm for decentralized extrema finding in circular configurations of processors

Communications of the ACM
Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes

Communications of the ACM
Election in Asynchronous Complete Networks with Intermittent Link Failures

IEEE Transactions on Computers
A principle for resilient sharing of distributed resources

ICSE '76 Proceedings of the 2nd international conference on Software engineering
Design and analysis of dynamic leader election protocols in broadcast networks

Distributed Computing
Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links

Distributed Computing
An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Leader election is an important problem in distributed computing, and it is applied in many scientific fields such as communication network [1,2,3,4,5], centralized mutual exclusion algorithm [6,7], centralized control IPC, Berkeley algorithm, etc. Synchronization between processes often requires one process acting as a coordinator. The coordinator might not remain the same, because it might get crashed. Bully election algorithm is one of the classic methods which is used to determine the process with highest priority number as the coordinator. In this paper, we will discuss the drawbacks of Garcia_Molina's Bully algorithm and then we will present an optimized method for the Bully algorithm called modified bully algorithm. Our analytical simulation shows that, our algorithm is more efficient rather than the Bully algorithm with fewer message passing and fewer stages.