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

Masafumi Yamashita, Tsunehiko Kameda

研究成果: ジャーナルへの寄稿学術誌査読

54 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ(範囲)878-887
ページ数10
ジャーナルIEEE Transactions on Parallel and Distributed Systems
10
9
DOI
出版ステータス出版済み - 1999

!!!All Science Journal Classification (ASJC) codes

  • 信号処理
  • ハードウェアとアーキテクチャ
  • 計算理論と計算数学

フィンガープリント

「Leader election problem on networks in which processor identity numbers are not distinct」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル