Distributed allocation with pools of servers

Gregory R. Andrews, David P. Dobkin, Peter J. Downey

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982
PublisherAssociation for Computing Machinery
Pages73-83
Number of pages11
ISBN (Print)0897910818
DOIs
StatePublished - Aug 18 1982
Event1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 - Ottawa, Canada
Duration: Aug 18 1982Aug 20 1982

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982
CountryCanada
CityOttawa
Period8/18/828/20/82

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Distributed allocation with pools of servers'. Together they form a unique fingerprint.

Cite this