Resource Allocation in Multiprocess Computer Systems
The dynamic allocation for limited processor and main memory resources among members of a user community is investigated as a supply-and-demand problem. The work is divided into four phases. First phase is the construction of the working set model for program behavior. This model is based on local...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149370 |
| _version_ | 1826205945768706048 |
|---|---|
| author | Denning, Peter James |
| author2 | Dennis, Jack B. |
| author_facet | Dennis, Jack B. Denning, Peter James |
| author_sort | Denning, Peter James |
| collection | MIT |
| description | The dynamic allocation for limited processor and main memory resources among members of a user community is investigated as a supply-and-demand problem. The work is divided into four phases. First phase is the construction of the working set model for program behavior. This model is based on locality, the concept that, during any interval of execution, a program favors a subset of its information; a computation's working set is a dynamic measure of this set of favored information. A working set storage management policy is one that allocates processors to a computation if and only if there is enough uncommitted space in main memory to contain its working set. |
| first_indexed | 2024-09-23T13:21:33Z |
| id | mit-1721.1/149370 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T13:21:33Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1493702023-03-30T03:39:16Z Resource Allocation in Multiprocess Computer Systems Denning, Peter James Dennis, Jack B. The dynamic allocation for limited processor and main memory resources among members of a user community is investigated as a supply-and-demand problem. The work is divided into four phases. First phase is the construction of the working set model for program behavior. This model is based on locality, the concept that, during any interval of execution, a program favors a subset of its information; a computation's working set is a dynamic measure of this set of favored information. A working set storage management policy is one that allocates processors to a computation if and only if there is enough uncommitted space in main memory to contain its working set. 2023-03-29T14:53:33Z 2023-03-29T14:53:33Z 1968-05 https://hdl.handle.net/1721.1/149370 14193220 MIT-LCS-TR-050 MAC-TR-050 application/pdf |
| spellingShingle | Denning, Peter James Resource Allocation in Multiprocess Computer Systems |
| title | Resource Allocation in Multiprocess Computer Systems |
| title_full | Resource Allocation in Multiprocess Computer Systems |
| title_fullStr | Resource Allocation in Multiprocess Computer Systems |
| title_full_unstemmed | Resource Allocation in Multiprocess Computer Systems |
| title_short | Resource Allocation in Multiprocess Computer Systems |
| title_sort | resource allocation in multiprocess computer systems |
| url | https://hdl.handle.net/1721.1/149370 |
| work_keys_str_mv | AT denningpeterjames resourceallocationinmultiprocesscomputersystems |