Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Page Replacement Tecnique Os c5

    Uploaded by

    sivashriraj1955
    The document discusses different page replacement algorithms used in operating systems: 1) FIFO algorithm replaces the oldest page, maintaining a queue of pages from oldest to newest. 2) Optimal algorithm replaces the page that will not be used for the longest time in the future, minimizing future page faults. 3) LIFO algorithm replaces the newest page, maintaining a stack and replacing the top page on a page fault.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Page Replacement Tecnique Os c5

    Uploaded by

    sivashriraj1955
    7 views8 pages
    The document discusses different page replacement algorithms used in operating systems: 1) FIFO algorithm replaces the oldest page, maintaining a queue of pages from oldest to newest. 2) Optimal algorithm replaces the page that will not be used for the longest time in the future, minimizing future page faults. 3) LIFO algorithm replaces the newest page, maintaining a stack and replacing the top page on a page fault.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses different page replacement algorithms used in operating systems: 1) FIFO algorithm replaces the oldest page, maintaining a queue of pages from oldest to newest. 2) Optimal algorithm replaces the page that will not be used for the longest time in the future, minimizing future page faults. 3) LIFO algorithm replaces the newest page, maintaining a stack and replacing the top page on a page fault.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    7 views8 pages

    Page Replacement Tecnique Os c5

    Uploaded by

    sivashriraj1955
    The document discusses different page replacement algorithms used in operating systems: 1) FIFO algorithm replaces the oldest page, maintaining a queue of pages from oldest to newest. 2) Optimal algorithm replaces the page that will not be used for the longest time in the future, minimizing future page faults. 3) LIFO algorithm replaces the newest page, maintaining a stack and replacing the top page on a page fault.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 8

    PAGE REPLACEMENT

    TECNIQUE
    OS COMPONENT 5
    SHRI RAAM S
    22BCA056
    II BCA A
    INTRODUCTION
    • Page replacement is needed in the operating systems that use virtual memory
    using Demand Paging. As we know that in Demand paging, only a set of pages
    of a process is loaded into the memory. This is done so that we can have more
    processes in the memory at the same time.

    • When a page that is residing in virtual memory is requested by a process for its
    execution, the Operating System needs to decide which page will be replaced
    by this requested page. This process is known as page replacement and is a vital
    component in virtual memory management.
    Why Need Page Replacement
    Algorithms?
    • Page Fault: A Page Fault occurs when a program running in CPU tries to access a
    page that is in the address space of that program, but the requested page is currently
    not loaded into the main physical memory, the RAM of the system.

    • Since the actual RAM is much less than the virtual memory the page faults occur. So
    whenever a page fault occurs, the Operating system has to replace an existing page in
    RAM with the newly requested page. In this scenario, page replacement algorithms
    help the Operating System in deciding which page to replace. The primary objective
    of all the page replacement algorithms is to minimize the number of page faults.
    First In First Out (FIFO)

    • FIFO algorithm is the simplest of all the page replacement algorithms. In


    this, we maintain a queue of all the pages that are in the memory currently.
    The oldest page in the memory is at the front-end of the queue and the
    most recent page is at the back or rear-end of the queue.
    • Whenever a page fault occurs, the operating system looks at the front-end
    of the queue to know the page to be replaced by the newly requested page.
    It also adds this newly requested page at the rear-end and removes the
    oldest page from the front-end of the queue.
    Optimal Page Replacement in OS

    • Optimal page replacement is the best page replacement algorithm as this


    algorithm results in the least number of page faults. In this algorithm, the
    pages are replaced with the ones that will not be used for the longest
    duration of time in the future. In simple terms, the pages that will be
    referred farthest in the future are replaced in this algorithm.
    Last In First Out (LIFO) Page Replacement Algorithm

    • This is the Last in First Out algorithm and works on LIFO principles. In
    this algorithm, the newest page is replaced by the requested page. Usually,
    this is done through a stack, where we maintain a stack of pages currently
    in the memory with the newest page being at the top. Whenever a page
    fault occurs, the page at the top of the stack is replaced.

    You might also like