Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{176859,
        author = {Parul Kashyap},
        title = {A Theoretical Dissection of Demand Paging and the Comparative Dynamics of Page Replacement Policies in Virtual Memory Management},
        journal = {International Journal of Innovative Research in Technology},
        year = {2025},
        volume = {11},
        number = {11},
        pages = {6464-6471},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=176859},
        abstract = {A key idea in contemporary operating systems that permits effective use of physical memory is virtual memory management. Performance optimization heavily relies on demand paging, a lazy-loading approach that only retrieves pages when required. Demand paging is theoretically broken down in this study, which also critically analyzes the effectiveness and behavior of the main page replacement policies, such as Optimal Replacement, LRU, and FIFO (First-In First-Out). We investigate how each policy affects page fault frequency, memory access time, and system throughput using a conceptual framework. The paper's conclusion provides a clear grasp of when and why particular strategies perform better under different workloads through a comparative review based on theoretical insights rather than actual simulations.},
        keywords = {Demand Paging, Page Replacement Algorithms, Memory Management, Page Fault, Virtual Memory.},
        month = {April},
        }