Page Replacement Algorithms Simulator!


In an operating system that uses paging for memory management, a page replacement algorithm is needed to decide which page needs to be replaced when new page comes in.

Find Out More

Brief Explanation


Since actual physical memory is much smaller than virtual memory, page faults happen. A page fault happens when a running program accesses a memory page that is mapped into the virtual address space, but not loaded in physical memory. In case of page fault, Operating System might have to replace one of the existing pages with the newly needed page. Different page replacement algorithms suggest different ways to decide which page to replace. The target for all algorithms is to reduce the number of page faults.

View Demo!

VARIOUS PAGE REPLACEMENT ALGORITHMS

FIFO

This is the simplest page replacement algorithm.

More Info Demo

LIFO

As the name suggests, it replaces the newest page that arrived at last in the main memory.

More Info Demo

LRU

This algorithm replaces the page that has not been referred by the CPU for the longest time.

More Info Demo

OPTIMAL

This algorithm replaces the page that will not be referred by the CPU in future for the longest time.

More Info Demo

RANDOM

As the name suggests, this algorithm randomly replaces any page.

More Info Demo