Systematic analysis and simulation of classical page replacement algorithms: A proposed novel wsclock-derivative

Modern operating systems are complex system software, with a variety of interfaces that make developing software for them simple and more importantly, ensure they execute efficiently and fulfill high performance requirements. One of the fundamental techniques used here is Virtual Memory Management (VMM) that summarily allocates virtual memory segments to the executing processes. Due to practical and economic constraints, the system memory available in limited, and even with the use of slower secondary memory, there are frequent instances of the memory and cache pages needing replacement. Thus, algorithms for deciding the fate of the pages are needed. This paper proposes a page replacement algorithm to perform this task, as well as summarizes, evaluates and objectively represents the classical as well as modern page replacement algorithms, with a qualitative analysis of their performance under specific scenarios.