Skip to main content
Springer Nature Link
Log in

Efficient elections in chordal ring networks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We study the message complexity of the problem of distributively electing a leader in chordal rings. Such networks consist of a basic ring with additional links, the extreme cases being the oriented ring and the complete graph with a full sense of direction. We present a general election algorithm for these networks, and prove its optimality. As a corollary, we show thatO(logn) chords at each processor suffice to obtain an algorithm that uses at mostO(n) messages; this improves and extends a previous work, where an algorithm, also usingO(n) messages, was suggested for the case where alln-1 chords exist (the oriented complete network).

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Arden and H. Lee, Analysis of Chordal Ring Network,IEEE Transactions on Computers, Vol. 30, 1981, pp. 291–294.

    Article  MathSciNet  Google Scholar 

  2. J. Burns, A Formal Model for Message-Passing Systems, Technical Report 91, Indiana University, 1980.

  3. D. Dolev, M. Klawe, and M. Rodeh, AnO(n logn) Unidirectional Distributed Algorithm for Extrema-Finding in a Circle,Journal of Algorithms, Vol. 3, No. 3, 1982, pp. 245–260.

    Article  MATH  MathSciNet  Google Scholar 

  4. W. R. Franklin, On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors,Communications of the ACM, Vol. 25, No. 5, 1982, pp. 336–337.

    Article  MathSciNet  Google Scholar 

  5. G. N. Frederickson and N. A. Lynch, Electing a Leader in a Synchronous Ring,Journal of the ACM, Vol. 34, No. 1, 1987, pp. 98–115.

    Article  MATH  MathSciNet  Google Scholar 

  6. E. Korach, S. Moran, and S. Zaks, Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors,Proceedings of the Third ACM Symposium on Principles of Distributed Computing, Vancouver, August 1984, pp. 199–207; also to appear inTheoretical Computer Science.

  7. M. Loui, T. Matsushita, and D. West, Election in a Complete Network with a Sense of Direction,Information Processing Letters, Vol. 22, 1986, pp. 185–187.

    Article  MathSciNet  Google Scholar 

  8. J. Pachl, E. Korach, and D. Rotem, Lower Bounds for Distributed Extrema-Finding Algorithms,Journal of the ACM, Vol. 31, No. 4, 1984, pp. 905–918.

    Article  MATH  MathSciNet  Google Scholar 

  9. G. L. Peterson, AnO(n logn) Unidirectional Algorithm for the Circular Extrema Problem,ACM Transactions on Programming Languages and Systems, Vol. 4, No. 4, 1982, pp. 758–762.

    Article  MATH  Google Scholar 

  10. J. Sack, N. Santoro, and J. Urrutia,O(n) Election Algorithms in Complete Networks with Global Sense of Orientation, Report SCS-TR-49, Carleton University, Ottawa, May 1984.

    Google Scholar 

  11. N. Santoro, Sense of Direction, Topological Awareness and Communication Complexity,SIGACT News, 16:2, 1984, pp. 50–56.

    Article  MathSciNet  Google Scholar 

  12. N. Santoro, J. Urrutia, and S. Zaks, Sense of Direction and Communication Complexity in Distributed Networks,Proceedings of the First International Workshop on Distributed Algorithms on Graphs, Ottawa, August 1985, pp. 123–132.

  13. C. K. Wong and D. Coppersmith, A Combinatorial Problem Related to Multimodule Memory Organization,Journal of the ACM, Vol. 21, 1974, pp. 392–402.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Liebniz Center, Department of Computer Science, Hebrew University, Jerusalem, Israel

    Hagit Attiya

  2. Department of Computer Science, University of Utrecht, Utrecht, The Netherlands

    Jan van Leeuwen

  3. School of Computer Science, Carleton University, Ottawa, Canada

    Nicola Santoro

  4. Department of Computer Science, Technion, Haifa, Israel

    Shmuel Zaks

Authors
  1. Hagit Attiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan van Leeuwen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicola Santoro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shmuel Zaks
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Israel Cidon and Inder S. Gopal.

The work of this author was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No. A2415.

The work of this author was supported in part by Technion Research Grant No. 120-0641.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Attiya, H., van Leeuwen, J., Santoro, N. et al. Efficient elections in chordal ring networks. Algorithmica 4, 437–446 (1989). https://doi.org/10.1007/BF01553900

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01553900

Key words

Search

Navigation