Electing a leader in a ring with link failures (Q1075046)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Electing a leader in a ring with link failures |
scientific article; zbMATH DE number 3949686
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Electing a leader in a ring with link failures |
scientific article; zbMATH DE number 3949686 |
Statements
Electing a leader in a ring with link failures (English)
0 references
1987
0 references
We investigate the message complexity of electing a leader in a ring of asynchronous processors. Our work deviates from the previous works on electing a leader in that we consider the effect of link failures. A link is said to fail if some message sent through it never reaches its destination. We distinguish the case where n is known from the case n unknown. Our main result is an O(n log n) algorithm for electing a leader on an n-processor ring (the case n is known).
0 references
distributed computation
0 references
asynchronous networks
0 references
message complexity
0 references
ring of asynchronous processors
0 references
link failures
0 references
algorithm
0 references
0 references
0.8863237
0 references
0.8751676
0 references
0.8751676
0 references
0.8713343
0 references
0.8663786
0 references
