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

Masafumi Yamashita; Tsunehiko Kameda

doi:10.1109/71.798313

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

Masafumi Yamashita, Tsunehiko Kameda

Mathematical Informatics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	878-887
Number of pages	10
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	10
Issue number	9
DOIs	https://doi.org/10.1109/71.798313
Publication status	Published - Dec 1 1999

All Science Journal Classification (ASJC) codes

Signal Processing
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/71.798313

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

@article{aafc39c720c04b7792e961cb5c994b58,

title = "Leader election problem on networks in which processor identity numbers are not distinct",

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.",

author = "Masafumi Yamashita and Tsunehiko Kameda",

year = "1999",

month = dec,

day = "1",

doi = "10.1109/71.798313",

language = "English",

volume = "10",

pages = "878--887",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "9",

}

TY - JOUR

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

AU - Yamashita, Masafumi

AU - Kameda, Tsunehiko

PY - 1999/12/1

Y1 - 1999/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033185158&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033185158&partnerID=8YFLogxK

U2 - 10.1109/71.798313

DO - 10.1109/71.798313

M3 - Article

AN - SCOPUS:0033185158

VL - 10

SP - 878

EP - 887

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 9

ER -