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 | |
| Publication status | Published - Dec 1 1999 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics
Cite this
Leader election problem on networks in which processor identity numbers are not distinct. / Yamashita, Masafumi; Kameda, Tsunehiko.
In: IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 9, 01.12.1999, p. 878-887.Research output: Contribution to journal › Article
}
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 -