期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：7
页码：233-237
出版社：Shri Pannalal Research Institute of Technolgy
摘要：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.
