Dynamic Partitioning of the Main Memory Using the Working Set Concept

An algorithm to divide the main memory among N competing programs with different characteristics, running in a multiprogramming and virtual memory environment, is proposed. The algorithm is based on an optimal allocation policy, which is derived in this paper, using the concept of the working set. A brief description of the hardware implementation of the algorithm is also presented. It is shown that under this optimal allocation policy “the value of a page-frame” (the amount of reduction in the page fault rate if an additional page frame is allocated to that program) to each program is the same.