|
|
|
Leader Election: Distributed Computing, Bully Algorithm, Chang and Roberts Algorithm
|
(Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!
| Inhalt: |
| Please note that the content of this book primarily consists of articles
available from Wikipedia or other free sources online. 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
unaware which node will serve as the "leader," or coordinator, of the
task. 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 identities, then the nodes can compare their
identities, and decide that the node with the highest identity is the
leader. |
|
i.d.R. innert 7-14 Tagen versandfertig
Newsfeed | 
Facebook | 
Twitter
