Metraipolis › archive › dc_0ccdecac5c01

Leader election — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Leader_election
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:56:56.711Z
SHA-256 of the archived text
cece48ee9d895e9d2a79b4743995b7588c4b2250b549fdff98e19fdadb012ece
Stable URL of this page
https://metraipolis.com/documento/dc_0ccdecac5c01

How to cite

Leader election — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Leader_election (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0ccdecac5c01 (Metraipolis archive dc_0ccdecac5c01, sha256 cece48ee9d895e9d2a79b4743995b7588c4b2250b549fdff98e19fdadb012ece)
BibTeX
@misc{dc0ccdecac5c01,
  title = {Leader election — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Leader_election},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0ccdecac5c01; sha256 cece48ee9d895e9d2a79b4743995b7588c4b2250b549fdff98e19fdadb012ece},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Leader_election. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 has 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. The network nodes communicate among themselves in order to decide which of them will get into the "leader" state. For that, they need some method in order to break the symmetry among them. For example, if each node has unique and comparable identities, then the nodes can compare their identities, and decide that the node with the highest identity is the leader. The definition of this problem is often attributed to LeLann, who formalized it as a method to create a new token in a token ring network in which the token has been lost. Leader election algorithms are designed to be economical in terms of total bytes transmitted, and time. The algorithm suggested by Gallager, Humblet, and Spira for general undirected graphs has had a strong impact on the design of distributed algorithms in general, and won the Dijkstra Prize for an influential paper in distributed computing. Many other algorithms have been suggested for different kinds of network graphs, such as undirected rings, unidirectional rings, complete graphs, grids, directed Euler graphs, and others. A general method that decouples the issue of the graph family from the design of the leader election algorithm was suggested by Korach, Kutten, and Moran.

Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «distributed computing»).
Fonte: Wikipedia in inglese, voce «Leader election» — https://en.wikipedia.org/wiki/Leader_election
Wikidata Q1424189 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1424189
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Leader_election?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1341681953, consultata il 2026-10-06T00:14:42.226Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 46ae5effab0fff1bfd7471e708debe8634f1fbf77fdb2f8fa8dd83722707bd24