An experimental evaluation of leader election algorithms for ring networks

Yukinori Ikegawa, Masafumi Yamashita, Tadashi Ae

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)10-18
Number of pages9
JournalSystems and Computers in Japan
Issue number3
Publication statusPublished - 1991

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'An experimental evaluation of leader election algorithms for ring networks'. Together they form a unique fingerprint.

Cite this