Skip to main content
SpringerLink
Log in

Optimal computation of global sensitive functions in fast networks

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

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

Included in the following conference series:

Abstract

The common practice in distributed algorithms research was to assume that the computation time is zero, and assign a cost only to the communication. This was justified at the times that the communication was the bottleneck of a network. However, lately there has been a dramatic increase in the capacity of communication links so that we can no longer make this assumption.

In this paper we find optimal algorithms for distributed computation of "global sensitive" functions in the case that the computation time is some given P, and the communication time is some given C. (Roughly speaking, a global sensitive function is one that depends on each of its inputs.)

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. A.Awerbuch, I. Cidon, I.S. Gopal, M. Kaplan and S. Kutten, "Distributed Control for PARIS," to appear in Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, August 1990.

    Google Scholar 

  2. Y. Afek, G.M. Landau, B. Schieber and M. Yung, "The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks", Information and Computation vol. 84 no. 1 january 1990, pp. 97–118.

    Google Scholar 

  3. I.Cidon, I.S.Gopal, S.Kutten, "New Models and Algorithms for Future Networks," Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing Toronto, Ontario, Canada, August 1988, pp. 75–89.

    Google Scholar 

  4. Slater, P.J., E.J. Cockayne, and S.T. Hedetniemi, "Information dissimination in Trees," SIAM J. on Computing 10 (1981), pp. 692–701.

    Google Scholar 

  5. Gallager, R.G., P.M. Humblet and P.M. Spira, "A Distributed Algorithm for Minimum-Weight Spanning Trees", ACM Transactions on Programming Languages and Systems, January 1983, Vol. 5, No. 1, pp. 67–77.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM T. J. Watson Research Center, 10598, Yorktown Heights, NY

    Israel Cidon, Inder Gopal & Shay Kutten

Authors
  1. Israel Cidon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Inder Gopal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shay Kutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cidon, I., Gopal, I., Kutten, S. (1991). Optimal computation of global sensitive functions in fast networks. In: van Leeuwen, J., Santoro, N. (eds) Distributed Algorithms. WDAG 1990. Lecture Notes in Computer Science, vol 486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54099-7_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-54099-7_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47405-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation