In the very large multiprocessor systems and, on a gander scale, computer networks now emerging, processes are not tied to fixed processors but run on processors taken from a pool of processors. Processors are released when a process dies, migrates or when the process crashes. In distributed operating systems using the service concept, processes can be clients asking for a service, servers giving a service or both. Establishing communication between a process asking for a service and a process giving that service, without centralized control in a distributed environment with mobile processes, constitutes the problem of 1 distributed matchmaking. Logically, such a match-making phase precedes routing in store-and-forward d6mputer networks of this type. Algorithms for distributed match-making are developed and their complexity is investigated in terms of message passes and in terms of storage needed. The heoretical limitations of distributed matchmaking are established, and the techniques are applied to several network topologies.
|Number of pages||11|
|Publication status||Published - Aug 1985|
|Event||4th Annual ACM Sympium on Principles of Distributed Computing, PODC - Minaki, Ontario, Canada|
Duration: 5 Aug 1985 → 7 Aug 1985
|Conference||4th Annual ACM Sympium on Principles of Distributed Computing, PODC|
|Period||5/08/85 → 7/08/85|
|Other||August 5-7, 1985|