Leader Election Algorithms in Distributed Systems?
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 6)Publication Date: 2014-06-30
Authors : Seema Balhara; Kavita Khanna;
Page : 374-379
Keywords : coordination; distributed system; election algorithm;
Abstract
A Distributed system is an application which executes a collection of protocols to coordinate the actions of multiple processes on a network, such that all components cooperate together in order to perform a single or small set of related tasks. It is very difficult for processes to cooperate with each other because of failures of any of the process during communication. The leader election is critical problem in distributed system as data is distributed among different node which is geographically separated. To maintain co-ordination between the node, leader node have to be selected. This paper contains the information about the various existing leader election mechanisms which is used for selecting the leader in different problems.
Other Latest Articles
- Culture effects on language and cognition in psycholinguistic experiment
- Literary translation universals: a psycholinguistic study of the novice translators' common choices
- THEORETICAL BASIS OF MONITORING OF QUALITY OF PROFESSIONAL ACTIVITY OF UNIVERSITY TEACHERS
- THE PEDAGOGICAL APPROACH TO COMMUNICATIVE LANGUAGE TEACHING IN PRIMARY SCHOOL
- PSYCHOMETRIC INDICATOR OF DOUBT IN COMPUTER TESTS (TORFL)
Last modified: 2014-06-23 01:11:31