Name
Abstract | ||
|---|---|---|
We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings K-k with bounded multiplicity k >= 2. However, we show that process-terminating leader election is possible in the sub-class u* boolean AND K-k, where u* is the class of rings which contain a process with a unique label. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-49259-9_1 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Leader election,Discrete mathematics,Combinatorics,Multiplicity (mathematics),Mathematics,Bounded function | Conference | 10083 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
2 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karine Altisen | 1 | 165 | 15.03 |
| Ajoy Kumar Datta | 2 | 317 | 40.76 |
| Stéphane Devismes | 3 | 192 | 25.74 |
| Anaïs Durand | 4 | 10 | 4.29 |
| Lawrence L. Larmore | 5 | 859 | 109.15 |