FIFO Page Replacement Algorithm

 

FIFO Page Replacement Algorithm

Page replacement algorithm are needed to decide which page to be replaced when new page comes in main memory. Page Fault – A page fault occurs when a program attempts to access a block of memory that is not stored in the physical memory, or RAM. Different page replacement algorithms are: FIFO, LRU, Optimal. The target for all algorithms is to reduce number of page faults.

FIFO Stands for First in first out. This is the simplest page replacement algorithm. The FIFO algorithm selects the page for replacement that has been in memory the longest time. When a new page must be loaded, the first inserted page is removed. The page to be removed is easily determined because its identification number is at the top of the FIFO stack.

 

Advantages

Easy to implement.

Disadvantage

In some circumstances pages are removed and loaded from memory too frequently.

Not efficient in compare to LRU.

To learn more about FIFO Page Replacement Algorithm, watch below video

Video : FIFO Page Replacement Algorithm

Watch more videos click here.