Computer networks
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Medusa: an experiment in distributed operating system structure
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communications of the ACM
Guardians and actions: linguistic support for robust, distributed programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Roscoe distributed operating system
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
StarOS, a multiprocessor operating system for the support of task forces
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
The Cambridge Model Distributed System
ACM SIGOPS Operating Systems Review
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Load Sharing in Distributed Multimedia-on-Demand Systems
IEEE Transactions on Knowledge and Data Engineering
A Generalized Scheme for Mapping Parallel Algorithms
IEEE Transactions on Parallel and Distributed Systems
Load balancing non-uniform parallel computations
Proceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control
| Hi-index | 0.01 |
Distributed systems make possible both a high degree of concurrency and robustness in the face of failure. One approach to achieving these goals is to employ pools of servers implementing major system functions. This paper describes the concept of pools of servers, and presents logically distributed, robust algorithms for one problem arising in this approach: the allocation of servers to clients. Three types of allocation problems are identified: free servers, preferred servers, and retentive servers. Allocation protocols based upon the idea of hash addressing are described and analyzed.