
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Masafumi Yamashita, Tsunehiko Kameda, "Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 9, pp. 878887, September, 1999.  
BibTex  x  
@article{ 10.1109/71.798313, author = {Masafumi Yamashita and Tsunehiko Kameda}, title = {Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {10}, number = {9}, issn = {10459219}, year = {1999}, pages = {878887}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.798313}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct IS  9 SN  10459219 SP878 EP887 EPD  878887 A1  Masafumi Yamashita, A1  Tsunehiko Kameda, PY  1999 KW  Distributed computing KW  fault tolerance KW  leader election KW  pointtopoint communication KW  broadcast communication KW  mailbox communication. VL  10 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 porttoport, broadcasttoport, porttomailbox, and broadcasttomailbox. 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.
[1] Y. Afek and M. Saks, “Detecting Global Termination Conditions in the Face of Uncertainty,” Proc. Sixth ACM Symp. Principles of Distributed Computing, Vancouver, B.C., Canada, pp. 109–124, 1987.
[2] D. Angluin, “Global and Local Properties in Networks of Processors,” Proc. 12th ACM Symp. Theory of Computing, pp. 82–93, 1980.
[3] R. BarYehuda and S. Kutten, “Fault Tolerant Leader Election with Termination Detection,” Technical Report CS198612, Dept. Computer Science, Duke Univ., 1986.
[4] P. Boldi, S. Shammah, S. Vigna, B. Codenotti, P. Gemmell, and J. Simon, “Symmetry Breaking in Anonymous Networks: Characterizations,” Proc. Fourth Israel Symp. Theory Computing and Systems, pp. 16–26, 1996.
[5] P. Boldi and S. Vigna, “Good Fibrations and Other Constructions which Preserve Sense of Direction,” Proc. Third Colloquium on Structural Information and Comm. Complexity (SIROCCO '96), Carleton Univ. Press, pp. 47–58, 1997.
[6] E. Chang and R. Roberts, “An Improved Algorithm for Decentralized ExtremaFinding in Circular Configurations of Processes,” Comm. ACM, vol. 22, no. 5, pp. 281–283, May 1979.
[7] D. de Werra, P. Hell, T. Kameda, N. Katoh, P. Slot, and M. Yamashita, “Graph Endpoint Coloring and Distributed Computing,” Networks, vol. 23, pp. 93–98, 1993.
[8] P. Flocchini, B. Mans, and N. Santoro, “Sense of Direction: Formal Definitions and Properties,” Proc. Colloquium Structural Information and Comm. Complexity, Carleton Univ. Press, pp. 1–29, 1995.
[9] G.N. Frederickson and N. Lynch, “Electing a Leader in a Synchronized Ring,” J. ACM, vol. 34, no. 1, pp. 98–115, 1987.
[10] A.F. Harary, Graph Theory. Reading, Mass.: AddisonWesley, 1969.
[11] R.E. Johnson and F.B. Schneider, “Symmetry and Similarity in Distributed Systems,” Proc. Fourth ACM Symp. Principles Distributed Computing, Minaki, Ont., Canada, pp. 13–22, 1985.
[12] M. Merritt, “Elections in the Presence of Faults,” Proc. Third Symp. Principles Distributed Computing, New York, pp. 134–142, ACM, 1984.
[13] N. Norris, “Universal Covers of EdgeLabeled Digraphs: Isomorphism to Depth$n1$Implies Isomorphism to All Depth,” Discrete Applied Math., vol. 56, no. 1, pp. 61–74, 1995.
[14] S. Olariu, I. Stojmenovic, and A. Zomaya, “On the Dynamic Initialization of Parallel Computers,” Proc. Int'l Parallel Processing Symp., Geneva, pp. 679–683, Apr. 1997.
[15] Proc. Colloquium Structural Information and Comm. Complexity, School of Computer Science, Carleton Univ., Ottawa, Canada, May 1994.
[16] “Structure, Information, and Communication Complexity International Informatics Series 1,” Proc. First Colloquium Structural Information and Comm. Complexity (SIROCCO '94), Ottawa, Canada, P. Flocchini, B. Mans, and N. Santoro, eds., Carleton Univ. Press, 1995.
[17] “Structure, Information and Communication Complexity, International Informatics Series 2,” Proc. Second Colloquium Structural Information and Comm. Complexity (SIROCCO '95), Olympia, Greece, L.M. Kirousis and E. Kranakis, eds., Carleton Univ. Press, 1996.
[18] “Structure, Information, and Communication Complexity, International Informatics Series 6,” Proc. Third Colloquium Structural Information and Comm. Complexity (SIROCCO '96), Siena, Italy, N. Santoro and P. Spirakis, eds., Carleton Univ. Press, 1997.
[19] M. Yamashita and T. Kameda, “Computing on Anonymous Networks,” Proc. Seventh ACM Symp. Principles Distributed Computing, Toronto, pp. 117–131, 1988.
[20] M. Yamashita and T. Kameda, “Electing a Leader When Processor Identity Numbers Are Not Distinct,” Proc. Third Int'l Workshop Distributed Algorithms, Nice, France, pp. 303–314, 1989.
[21] M. Yamashita and T. Kameda, “Computing Functions on Anonymous Networks,” Math. Systems Theory, vol. 29, pp. 331–356, 1996.
[22] M. Yamashita and T. Kameda, “Computing on Anonymous Networks, Part I: Characterizing the Solvable Cases,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 69–89, Jan. 1996.
[23] M. Yamashita and T. Kameda, “Computing on Anonymous Networks, Part II: Decision and Membership Problems,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 90–96, Jan. 1996.