Leader election problem on networks in which processor identity numbers are not distinct

Masafumi Yamashita, Tsunehiko Kameda

Research output: Contribution to journalArticlepeer-review

52 Citations (Scopus)

Abstract

In the networks considered in this paper, processors do not have distinct identity numbers. On such a network, we discuss the leader election problem and the problem of counting the number of processors having the same identity number. As the communication mode, we consider port-to-port, broadcast-to-port, port-to-mailbox, and broadcast-to-mailbox. For each of the above communication modes, we present: 1) an algorithm for counting the number of processors with the same identity number, 2) an algorithm for solving the leader election problem, and 3) a graph theoretical characterizatoin of the solvable class for the leader election problem.

Original languageEnglish
Pages (from-to)878-887
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Volume10
Issue number9
DOIs
Publication statusPublished - 1999

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Leader election problem on networks in which processor identity numbers are not distinct'. Together they form a unique fingerprint.

Cite this