Issue No. 09 - September (1999 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.798313
<p><b>Abstract</b>—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.</p>
Distributed computing, fault tolerance, leader election, point-to-point communication, broadcast communication, mailbox communication.
Tsunehiko Kameda, Masafumi Yamashita, "Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct", IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 878-887, September 1999, doi:10.1109/71.798313