OS Visualizations
CPU Scheduling
Address Translation
Memory Allocation
Page Replacement
File Allocation
Disk Scheduling
Log In
Log Out
P
A
G
E
R
E
P
L
A
C
E
M
E
N
T
Click On Algorithm To See The Strategy For Page Replacement
FIFO
Oldest page in main memory is the one which will be selected for replacement.
LRU
We look to the left of the table, that we have created we choose the further most page to get replaced.
Optimal
Replace the page that will not be used for the longest period of time. We look to the right further most.
LFU
In current stack at any iteration we choose that element for replacement which has smallest count in the incoming page stream.
MFU
In current stack at any iteration we choose that element for replacement which has highest count in the incoming page stream.
Load Data
First In First Out
Least Recently Used
Optimal
Least Frequently Used
Most Frequently Used
Select Animation Type:
Step By Step
Automatic