Algorithmica

, Volume 3, Issue 1, pp 367–391

Distributed match-making

  • Sape J. Mullender
  • Paul M. B. Vitányi
Article

DOI: 10.1007/BF01762123

Cite this article as:
Mullender, S.J. & Vitányi, P.M.B. Algorithmica (1988) 3: 367. doi:10.1007/BF01762123

Abstract

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called “distributed match-making” as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.

Key words

Locating objects Locating services Mutual exclusion Replicated data management Distributed algorithms Computational complexity Store- and-forward computer networks Network topology 

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Sape J. Mullender
    • 1
  • Paul M. B. Vitányi
    • 1
    • 2
  1. 1.Centrum voor Wiskunde en InformaticaAmsterdamThe Netherlands
  2. 2.Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations