Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Lower bounds for synchronous networks and the advantage of local information

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1987)

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

Included in the following conference series:

Abstract

For a natural, fairly general class of algorithms that solve a global problem like election in n-node m-link synchronous networks with local information we rigorously prove a lower bound Ω(m) for the number of messages that have to be exchanged among the processors. Without local information the lower bound becomes exactly m. This result matches (up to constant factors) the known upper bounds that hold even for asynchronous networks without local information. Further it is shown that relaxing any condition imposed on the algorithms one can design artificial protocols with message complexity O(n log n).

REISCHUK.DDADVS1.EARN

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. D. Angluin, Local and Global Properties in Networks of Processors, Proc. 12. ACM Symp. on Theory of Computing, 1980, 82–93.

    Google Scholar 

  2. G. Frederickson, N. Lynch, The Impact of Synchronous Communication on the Problem of Electing a Leader on a Ring, Proc. 16. ACM Symp. on Theory of Computing 1984, 493–503.

    Google Scholar 

  3. R. Graham, B. Rothschild, J. Spencer, Ramsey Theory, J. Wiley, 1980.

    Google Scholar 

  4. R. Gallager, P. Humblet, P. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Tr. on Programming Languages and Systems 5, 1983, 66–77.

    Article  Google Scholar 

  5. E. Korach, S. Moran, S. Zaks, Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors, Proc.3.ACM Symp. on Principles of Distributed Computing, 1984, 199–207.

    Google Scholar 

  6. J. Pachel, E. Korach, D. Rotem, A New Technique for Proving Lower Bounds for Distributed Maximum — Finding Algorithms, J.ACM 31, 1984, 905–918.

    Article  Google Scholar 

  7. P. Vitanyi, Distributed Elections in an Archimedean Ring of Processors, Proc. 16. ACM Symp. on Theory of Computing 1984, 542–547.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, TH Darmstadt, Alexanderstrasse 24, D-6100, Darmstadt, West-Germany

    Rüdiger Reischuk & Meinolf Koshors

Authors
  1. Rüdiger Reischuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meinolf Koshors
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reischuk, R., Koshors, M. (1988). Lower bounds for synchronous networks and the advantage of local information. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019817

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation