Distributed match-making |
| |
Authors: | Sape J Mullender and Paul M B Vitányi |
| |
Affiliation: | (1) Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands;(2) Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA |
| |
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.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands. |
| |
Keywords: | Locating objects Locating services Mutual exclusion Replicated data management Distributed algorithms Computational complexity Store- and-forward computer networks Network topology |
本文献已被 SpringerLink 等数据库收录! |
|