Abstract
In the very large multiprocessor systems and, on a grander 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 distributed match-making. Logically, such a match-making phase precedes routing in store-and-forward computer 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 theoretical limitations of distributed match-making are established, and the techniques are applied to several network topologies.
Original language | Undefined |
---|---|
Pages (from-to) | 54-64 |
Number of pages | 11 |
Journal | Operating systems review |
Volume | 20 |
Issue number | 2 |
DOIs | |
Publication status | Published - Apr 1986 |
Keywords
- EWI-1262
- IR-55902