Resource Allocation in Multiprocess Computer Systems
Name
MIT-LCS-TR-050.pdf
Size
5.6 MB
Format
Adobe PDF
Checksum (MD5)
79206f38b8eebffab35c1c2e777e75ef
Author(s)
Denning, Peter James
Advisor(s)
Dennis, Jack B.
Date Issued
May 1968
Series/Report no.
MIT-LCS-TR-050
MAC-TR-050
Abstract
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.
Persistent DSpace Link
