Skip to main content
SpringerLink
Log in

Electing a leader in a synchronous recursively scalable network

  • Computer Architecture, Concurrency, Parallelism, Communication And Networking
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '90 (ICCI 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 468))

Included in the following conference series:

  • 139 Accesses

Abstract

A distributed leader finding algorithm in a synchronous recursively scalable network is developed. It requires less than 4.5N messages where N is the number of processors in the network.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Le Lann, “Distributed Systems — Towards a Formal Approach,” in Information Processing 77, B. Gilchrist, Ed. Amsterdam, The Netherlands: North-Holland, 1977, pp. 155–160.

    Google Scholar 

  2. H. Garcia-Molina, “Elections in a Distributed Computing System,” IEEE Trans. Comput. vol. C-31, pp. 48–59, Jan. 1982.

    Google Scholar 

  3. N. Lynch, “A Hundred Impossibility Proofs for Distributed Computing,” Proc. Eighth Ann. ACM Symp. PODC, 1989, pp. 1–27.

    Google Scholar 

  4. V. M. Glushkov, et.al. “Recursive Machines,” in Information Processing 74, Amsterdam, The Netherlands: North-Holland, 1974, pp. 65–70.

    Google Scholar 

  5. A. L. Davis, “The Architecture and System Method of DDM1: A Recursively Structured Data Driven Machine,” SIGARCH Newsletter, vol. 6, no. 7, pp. 210–215, April 1978.

    Google Scholar 

  6. G. A. Mago, “A Network of Microprocessors to Execute Reduction Languages — Part I and II,” Int. J. Comput. Inform. Sci., vol. 8, 1979, no. 5, pp. 349–385, no. 6, pp. 435–471.

    Google Scholar 

  7. W. T. Wilner, “Recursive Machines,” in Algorithmically Specialized Parallel Computers, L. Snyder, et.al., Eds. Academic Press, Inc., 1985, pp. 95–104.

    Google Scholar 

  8. P. C. Treleaven and R. P. Hopkins, “A Recursive Computer Architecture for VLSI,” SIGARCH Newsletter, vol. 13, no. 3, pp. 229–238, April 1982.

    Google Scholar 

  9. R. W. Baldwin, “An Evaluation of the Recursive Machine Architecture,” Ph.D. Thesis, M.I.T. Dept. Elec. Engg. and Comp. Sci., April 1982.

    Google Scholar 

  10. C. Kirner, “Design of a Recursively Structured Parallel Computer,” Proc. 17th Ann. ACM Comp. Sci. Conf., 1989, p. 416.

    Google Scholar 

  11. G. Della Vecchia and C. Sanges, “Recursively Scalable Networks for Message Passing Architectures,” in: Parallel Processing and Applications, E. Chiricozzi and A. D'Amico (Eds.), Elsevier Science Publishers B.V. (North-Holland), 1988, pp. 33–40.

    Google Scholar 

  12. G. Della Vecchia and C. Sanges, “An Optimized Broadcasting Technique for WK-Recursive Topologies,” Proc. 12th IMACS World Congress on Sci. Comput., 1988, pp. 291–293.

    Google Scholar 

  13. M. C. Loui, T. A. Matsushita and D. B. West, “Election in a Complete Network with a Sense Direction,” Inform. Process. Lett. vol. 22, no. 4, 1986, pp. 185–187.

    Google Scholar 

  14. G. H. Masapati, “Effect of Preprocessing on Election in a Complete Network with a Sense of Direction,” Technical Report, TR-89-56, Dept. of CSI, Univ. of Ottawa, 1989.

    Google Scholar 

  15. N. Santoro, “Sense of Direction, Topological Awareness and Communication Complexity,” SIGACT News, vol. 16, no. 2, 1984, pp. 52–56.

    Google Scholar 

  16. D. Dolev, M. Klawe and M. Rodeh, “An O(n logn) Unidirectional Distributed Algorithm for Extrema Finding in a Circle,” J. Algorithm, vol. 3, 1982, pp. 245–260.

    Google Scholar 

  17. G. L. Peterson, “An O(nlogn) unidirectional algorithm for the circular extrema problem,” ACM Trans. Prog. Lang. and Syst., vol. 4, 1982, pp. 758–762.

    Google Scholar 

  18. S. Moran, M. Shalom and S. Zaks, “An 1.44...nlogn Algorithm for Distributed Leader Finding in Bidirectional Rings of Processors,” IBM Research report, RC 11933, 1986.

    Google Scholar 

  19. H. Attiya, J. van Leeuwen, N. Santoro and S. Zaks, “Efficient Elections in Chordal Ring Networks,” Algorithmica, vol. 4, 1989, pp. 437–446.

    Google Scholar 

  20. H. H. Abu-Amara, “Fault-Tolerant Distributed Algorithms for Agreement and Election,” Ph.D. Thesis UILU-ENG-88-2242, ACT-95, Univ. Illinois at Urbana-Champaign, Aug. 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Ottawa, K1N 6N5, Ottawa, Canada

    G. H. Masapati & Hasan Ural

Authors
  1. G. H. Masapati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hasan Ural
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Masapati, G.H., Ural, H. (1991). Electing a leader in a synchronous recursively scalable network. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation