Communications of the ACM - Special section on computer architecture
Classification Categories and Historical Development of Circuit Switching Topologies
ACM Computing Surveys (CSUR)
Reverse path forwarding of broadcast packets
Communications of the ACM
Distributed communication via global buffer
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Programming with abstract data types
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Broadcast protocols in packet switched computer networks.
Broadcast protocols in packet switched computer networks.
An overview of the Amoeba distributed operating system
ACM SIGOPS Operating Systems Review
| Hi-index | 0.01 |
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.