Abstract
The leader election problem is a problem of determining a unique leader, in the sense that the elected leader knows that it is elected and the processors which are not elected know that they are not elected. Under the assumption that the processors have unique identifiers, the problem can be regarded as the maximum (identifier) finding problem. This paper considers ten typical leader election algorithms for the ring network and evaluates them in terms of the average number of messages exchanged during computation.
| Original language | English |
|---|---|
| Pages (from-to) | 10-18 |
| Number of pages | 9 |
| Journal | Systems and Computers in Japan |
| Volume | 22 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1991 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Hardware and Architecture
- Computational Theory and Mathematics