Back to University of Twente portal
Distributed match-making
Mullender, Sape J. and Vitanyi, Paul M.B. (1988) Distributed match-making. Algorithmica, 3 (3). pp. 367-391. ISSN 1432-0541
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 1312Kb |
| 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. |
| Item Type: | Article |
| Copyright: | © 1988 Springer |
| Link to this item: | http://purl.utwente.nl/publications/55888 |
| Official URL: | http://dx.doi.org/10.1007/BF01762123 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page