Refresh Rate Identification Strategy for Optimal Page Replacement Algorithms for Virtual Memory Management

Operating system offers a service known as memory management which manages and guides primary memory. It moves processes between disk and main memory during the execution back and forth. The process in which we provisionally moves process from primary memory to the hard disk so the memory is available for other processes. This process is known as swapping. Page replacement techniques are the methods by which the operating system concludes which memory pages to be swapped out and write to disk, whenever a page of main memory is required to be allocated. There are different policies regarding how to select a page to be swapped out when a page fault occurs to create space for new page. These Policies are called page replacement algorithms. In this paper the strategy for identifying the refresh rate for ‘Aging’ page replacement algorithm is presented and evaluated. Keywords: Aging algorithm, page replacement algorithm, refresh rate, virtual memory management.

Working Set Analytics

The working set model for program behavior was invented in 1965. It has stood the test of time in virtual memory management for over 50 years. It is considered the ideal for managing memory in operating systems and caches. Its superior performance was based on the principle of locality, which was discovered at the same time; locality is the observed tendency of programs to use distinct subsets of their pages over extended periods of time. This tutorial traces the development of working set theory from its origins to the present day. We will discuss the principle of locality and its experimental verification. We will show why working set memory management resists thrashing and generates near-optimal system throughput. We will present the powerful, linear-time algorithms for computing working set statistics and applying them to the design of memory systems. We will debunk several myths about locality and the performance of memory systems. We will conclude with a discussion of the application of the working set model in parallel systems, modern shared CPU caches, network edge caches, and inventory and logistics management.

Development of Hyperset Paging mechanism

Algorithms for page replacement play important roles in virtual memory management, especially in paging operating systems. Page substitution happens when the required page is not retained in the memory (file fault) or the free accessible file is not adequate to fulfill the requirement. It is either there are none or the amount of free sites is fewer than the required total. Two regular page replacements were hybridized as Hybrid Page replacements (HRA) in this analysis (LRU and OptimalOPT algorithms recently used). For its service, HRA is based on the principle of OPT and LRU. The HRA was determined by comparing the page failures caused with the default algorithms First InFirst Out FIFO, LRU and Optimal. Tests showed the amount of frames through to 4 and beyond the HRA outperformed FIFO, OPT and LRU.