Copyright © 2025 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{161164,
        author = {Dr. Piyush O. Arora and Bipin B. Jadav},
        title = {FL: A modified and Combined Approach for Page Replacement in Operating Systems},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {9},
        number = {8},
        pages = {917-922},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=161164},
        abstract = {Operating system executes processes by page replacement, which is one of the basic requirements of any operating system. There has been continuous and tremendous study towards the design of algorithms that have minimum number of page faults. Variety of page replacement algorithms have been proposed and applied in different situations, in which FIFO (first in first out) and LRU (least recently used) are two of the most popular page replacement policies.
Modern operating systems strive for throughput maximization by reducing page faults. As page fault rate decreases, efficiency of an algorithm increases, due to the fact that operating system will be busy more in execution of processes, rather than doing I/O.
In the given literature, we propose FL approach, the combination of FIFO and LRU, is such a page replacement technique, which has led to equal or a smaller number of page faults than FIFO and LRU alone. Specifically, this algorithm works well in conditions, if a smaller number of memory frames are available. Conducting tests with a different reference strings and different number of frames, the page fault rate is examined.
},
        keywords = {Efficiency, FIFO, FL, LRU, Memory frames, Page Faults, Page replacement, Reference strings.},
        month = {},
        }