Advertisement

Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction

  • Toshimitsu Masuzawa
  • Naoki Nishikawa
  • Ken'ichi Hagihara
  • Nobuki Tokura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 392)

Abstract

This paper considers the leader election problem (LEP) in asynchronous complete networks with undetectable fail-stop failures. Especially, it is discussed whether presence of a global sense of direction affects the message complexity of LEP in faulty networks. For a complete network of n processors where k processors start the algorithm spontaneously and at most f p (<n/2) processors are faulty, this paper shows

(1) the message complexity of LEP is Θ(n+k f p ), if the complete network has a global sense of direction.

It is already known that LEP requires Ω(n log k+k f p ) message exchanges, if the complete network has no global sense of direction. Therefore, our result implies that the message complexity of LEP can be greatly reduced by using a global sense of direction in faulty networks as well as in reliable networks. For a complete network with at most f l (<n−1) faulty links (and no faulty processor), this paper also shows the similar result:

(2) the message complexity of LEP is Θ(n+k f l +f l log f l ), if the complete network has a global sense of direction.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Y.Afek and E.Gafni, “Time and message bound for election in synchronous and asynchronous complete networks”, Proc. 4th PODC, Minacki, Canada, pp. 186–195 (Aug. 1985).Google Scholar
  2. [2]
    R.Bar-Yehuda, S.Kutten, Y.Wolfstahl and S.Zaks, “Making distributed spanning tree algorithms fault-resilient”, Proc. 4th Ann. Sympo. on Theoretical Aspects of Computer Science, LNCS 247, pp.432–444 (Feb. 1987).Google Scholar
  3. [3]
    M.J. Fischer, N.A. Lynch and M.S. Paterson, “Impossibility of distributed consensus with one faulty process”, JACM, Vol.32, No.2, pp.374–382 (Apr. 1985).CrossRefGoogle Scholar
  4. [4]
    E. Korach, S.Moran and S.Zaks, “Tight lower and upper bounds for some distributed algorithms for a complete network of processors”, Proc. 3rd PODC, Vancouver, Canada, pp.199–207 (Aug. 1984).Google Scholar
  5. [5]
    S. Kutten, Y. Wolfstahl and S. Zaks, “Optimal distributed t-resilient election in complete networks”, Tech. Rep. #430, Computer Science Department, Technion, Israel (Aug. 1986).Google Scholar
  6. [6]
    S. Kutten, “Optimal fault-tolerant distributed construction of a spanning tree”, (the final version of [5]). “Google Scholar
  7. [7]
    M.C. Loui, T.A. Matsushita and D.B. West, “Election in complete networks with a sense of direction”, Information Processing Letters, vol.22, No.4, pp.185–187 (Apr. 1986).MathSciNetGoogle Scholar
  8. [8]
    T.Masuzawa, N.Nishikawa, K.Hagihara, N.Tokura and K.Fujita, “Leader election problem on faulty complete networks with global sense of direction” (in Japanese), Tech. Rep. IECEJ,COMP88-98 (Mar. 1989).Google Scholar
  9. [9]
    N. Santoro, “Sense of direction, topological awareness and communication complexity”, ACM SIGACT NEWS, vol.16, pp.50–56 (Summer 1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Toshimitsu Masuzawa
    • 1
  • Naoki Nishikawa
    • 2
  • Ken'ichi Hagihara
    • 1
  • Nobuki Tokura
    • 2
  1. 1.Education Center for Information ProcessingOsaka UniversityToyonaka, OsakaJapan
  2. 2.Faculty of Engineering ScienceOsaka UniversityToyonaka, OsakaJapan

Personalised recommendations