Least Recently Used (LRU) Page Replacement Algorithm in Operating Systems (OS)

Least Recently Used (LRU) Page Replacement Algorithm in Operating Systems (OS)?

LRU Page Replacement Algorithm works on a prediction that the pages that have been used more times in the last few instructions will probably be used again and again.

PF stands for the page fault. [su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight] FH is used in the table to represent the page hit. Read More[su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight]

1^st column: First of all, all memory is free.

2^nd column: Page 4 is loaded on memory. The page fault occurs because page 4 is already not on memory.

3^rd column: Page 6 is loaded on memory. The page fault occurs.

4^th column: Page 8 is loaded on memory. The page fault occurs.

5^th column: Page 4 is already loaded on memory. Page Hit occurs.

6th column: Page 2 is loaded on memory. The page fault occurs.

7th column: Page 6 is loaded on memory. The page fault [su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight] occurs.

MCQs on Page Replacement Algorithm