Least Recently Used

5

3

1,2,3,4,1,2,5,1,2,3,4,5

• Replace the page that has not been used for the longest period of time

5

4

8 Page Faults

No Belady’s Anomoly

- “Stack” Algorithm

- N frames subset of N+1

Previous slide

Next slide

Back to first slide

View graphic version