Leader election algorithm using heap structure

Authors:
M. Sepehri;M. Goodarzi
Affiliations:
Department of Computer Engineering & IT, Islamic Azad University, Fars Sciences and Research Branch, Fars, Iran;Department of Civil Engineering, Iran University of Science and Research, Tehran, Iran
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 11
Cited 0

Networks and distributed computation: concepts, tools, and algorithms

Networks and distributed computation: concepts, tools, and algorithms
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Distributed operating systems

Distributed operating systems
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms
Distributed Algorithms

Distributed Algorithms
Operating System Concepts, 4th Ed.

Operating System Concepts, 4th Ed.
Introduction to Algorithms

Introduction to Algorithms
Sense of direction, topological awareness and communication complexity

ACM SIGACT News
Leader election in hierarchical star network

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Elections in a Distributed Computing System

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several distributed algorithms require that there be a coordinator process in the entire system. Since all other processes in the system have to interact with the coordinator, they all must agree on who the coordinator is. Furthermore, if the coordinator process fails due to the failure of the site on which it is located, a new coordinator process must be elected to take up the job of the failed coordinator. Election algorithms are meant for electing a coordinator among currently running processes. This paper deals with the distributed leader election algorithm for a set of processes connected by a tree network. In this paper, we propose a linear time algorithm for leader election using heap structure and describe it in details.