RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS.
Abstract
The dynamic allocation of limited processor and main memory resources among members of a user community is investigated as a supply-and-demand problem. The work is divided in four phases. First, is the construction of the working set model for program behavior based on locality; a computation's working set is a dynamic measure of this set of favored information. The second phase is the definition and study of properties of system demand. A computation is the basic demand-making entity, placing demands jointly on processor and main memory resources. Its system demand is a pair (processor demand, memory demand). The third phase is the definition and study of the properties of system balance. Computations that demand resources are segregated into two classes -- the standby set, which is temporarily denied the use of system resources, and the balance set, which is granted the use of system resources. The system is balanced when the total system demand matches the system capacity. The fourth phase is to apply all these ideas to the design and administration of multiprocess computer systems. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1968
- Accession Number
- AD0675554
Entities
People
- Peter James Denning
Organizations
- Massachusetts Institute of Technology