language-icon Old Web
English
Sign In

Leader election

In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several computers (nodes). Before the task is begun, all network nodes are either unaware which node will serve as the 'leader' (or coordinator) of the task, or unable to communicate with the current coordinator. After a leader election algorithm has been run, however, each node throughout the network recognizes a particular, unique node as the task leader. In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several computers (nodes). Before the task is begun, all network nodes are either unaware which node will serve as the 'leader' (or coordinator) of the task, or unable to communicate with the current coordinator. After a leader election algorithm has been run, however, each node throughout the network recognizes a particular, unique node as the task leader.

[ "Algorithm", "Computer network", "Combinatorics", "Distributed computing", "Theoretical computer science", "Population protocol", "Bully algorithm" ]
Parent Topic
Child Topic
    No Parent Topic