Skip to main content
SpringerLink
Log in
Book cover

Aegean Workshop on Computing

AWOC 1988: VLSI Algorithms and Architectures pp 361–368Cite as

Weighted distributed match-making

Preliminary version

  • Distributed Computing
  • Conference paper
  • First Online:

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

Abstract

In many distributed computing environments, processes are concurrently executed by nodes in a store-and-forward network. Distributed control issues as diverse as name-server, mutual exclusion and replicated data management, involve making matches between processes. The generic paradigm is a formal problem called “distributed match-making”. The applications require solutions to weighted versions of the problem. We define new multi-dimensional and weighted versions, and the relations between the two, and develop a very general method to prove lower bounds on the complexity as a trade-off between number of messages and “distributedness”. The resulting lower bounds are tight in all cases we have examined.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fischer, M.J., Lynch, N.A., Burns, J.E., and Borodin, A., Distributed FIFO allocation of identical resources using small shared space, Massachusetts Institute of Technology, Cambridge, Mass., Report MIT/LCS/TM-290, October 1985.

    Google Scholar 

  2. Hardy, G. H., Littlewood, J. E. and Polyá, G., Inequalities, Cambridge University Press, 1934.

    Google Scholar 

  3. Maekawa, M., A \(\sqrt N\) Algorithm for Mutual Exclusion in Decentralized Systems, ACM Transactions on Computer Systems 3 (1985), pp. 145–159.

    Article  Google Scholar 

  4. Mullender, S. J. and Vitányi, P. M. B., Distributed Match-Making for Processes in Computer Networks, Preliminary Version, Proceedings of the 4th annual ACM Symposium on Principles of Distributed Computing, 1985, pp. 261–271.

    Google Scholar 

  5. Mullender, S. J. and Vitányi, P. M. B., Distributed Match-Making, Algorithmica, (1988).

    Google Scholar 

  6. Powell, M.L. and Miller, B. P., Process Migration in DEMOS/MP, Proceedings of the 9th ACM Symposium on Operating Systems Principles, 1983, pp. 110–119.

    Google Scholar 

  7. Tanenbaum, A.S. and S.J. Mullender, The Design of a Capability Based Distributed Operating System, The Computer Journal, 29(1986).

    Google Scholar 

  8. Tanenbaum, A.S., Computer Networks, Prentice-Hall, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centrum voor Wiskunde en Informatica Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    Evangelos Kranakis

  2. Centrum voor Wiskunde en Informatica and Universiteit van Amsterdam, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    Paul M. B. Vitányi

Authors
  1. Evangelos Kranakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul M. B. Vitányi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kranakis, E., Vitányi, P.M.B. (1988). Weighted distributed match-making. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040403

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation