Distributed match-making
Sape J. Mullender, Paul M. B. Vitanyi · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1987
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.