Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
