An Analysis of Page Allocation Strategies for Multiprogramming Systems with Virtual Memory
Donald D. Chamberlin, Samuel H. Fuller, L. Y. Liu
Abstract
Donald D. Chamberlin, Samuel H. Fuller, L. Y. Liu
Abstract
In a multiprogramming, virtual-memory computing system, many processes compete for the main storage page frames and CPU's of the real system. It is customary to define a subset of these processes called the “multiprogramming set” (MPS), and to allocate resources only to those processes currently in the MPS. Each process remains in the MPS for a limited time and is then demoted. The system paging manager controls the size of the MPS; it allocates the available page frames among the processes in the MPS and fetches appropriate pages into the page frames.
OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In a multiprogramming, virtual-memory computing system, many processes compete for the main storage page frames and CPU's of the real system. It is customary to define a subset of these processes called the “multiprogramming set” (MPS), and to allocate resources only to those processes currently in the MPS. Each process remains in the MPS for a limited time and is then demoted. The system paging manager controls the size of the MPS; it allocates the available page frames among the processes in the MPS and fetches appropriate pages into the page frames.
Key concepts: Computer multitasking, Demand paging, Paging, Computer science, Virtual memory, Page fault, Operating system, Process (computing)