The Research on the Dynamic Paging Algorithm Based on Working Set

The size of memory distributed to various processes by a system which uses a virtual memory, in some sense, determines the page fault, and further influences the system performance. After research, we find that the dynamic paging algorithm is much better than the static paging algorithm, for a process can change locality as it executes. This paper gives a study of the dynamic paging algorithm, points out that the working set algorithm is an effective way of realizing the dynamic paging algorithm, and proposes a method of using this algorithm, thus further improving the efficiency of both memory and system.