The Community for Technology Leaders
Green Image
This paper deals with the following mechanism for controlling the multiprogramming set in a demand paging system: processes are dynamically divided into several categories according to the number of page faults generated during their residence in main memory. A process is admitted into the multiprogramming set only if there is enough space free in the main memory to contain the number of pages corresponding to the current category of the process. Using a queueing network model of an interactive system with such a control mechanism we study the effectivenesss of the control considered, and, more particularly, its ability to partition the memory space according to the locality of processes.
queueing network models, Classes of processes, demand paging, hybrid analytical-simulation solution method, interactive system, multiprogrammed memory, process admission and memory allocation

J. Hernandez and A. Brandwajn, "A Study of a Mechanism for Controlling Multiprogrammed Memory in an Interactive System," in IEEE Transactions on Software Engineering, vol. 7, no. , pp. 321-331, 1981.
94 ms
(Ver 3.3 (11022016))