Academic Journals Database
Disseminating quality controlled scientific knowledge

A Comparative Analysis in Terms of Message Passing & Complexity of Different Coordinator Selection Algorithms in Distributed System

ADD TO MY LIST
 
Author(s): Ms. Sachi Choudhary, Mr. Dipesh Sharma

Journal: International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
ISSN 2278-1323

Volume: 1;
Issue: 7;
Start page: 233;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Election algorithm | Coordinator | Distributed System | Message Passing | Nodes | Algorithms | Process table | Crash failure.

ABSTRACT
In distributed systems, many of the algorithms that have been used are typically not completely symmetrical, and some node has to take the lead in initiating the algorithm. The main role of an elected coordinator is to manage the use of a shared resource in an optimal manner. Consequently, it is sometimes necessary that, from a set of nodes, a node must be selected as a leader or coordinator. So, to achieve this, several coordinator selection algorithms have been proposed so far. This paper proposes a comparative study and analysis of the different algorithms discussed, efficiency in terms of number of messages exchanged in each case and complexity of the various coordinator selection algorithms in distributed system.
Why do you need a reservation system?      Affiliate Program