Homework SourseConsider the following page reference string 7 2 3 1 2 5 3 4
Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 ,1.
Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms?
a) LRU Replacement
b) FIFO Replacement
c) Optimal Replacement
Solution
page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 ,1.
a) LRU Replacement:
Number of Page faults : 18
2) FIFO Replacement:
Number of Page faults : 17
c) Optimal Replacement:
| 7 | 7 | 7 | 1 | 1 | 1 | 3 | 3 | 3 | 7 | 7 | 7 | 7 | 5 | 5 | 5 | 2 | 2 | 2 | 1 |
| 2 | 2 | 2 | 2 | 2 | 2 | 4 | 4 | 4 | 4 | 1 | 1 | 1 | 4 | 4 | 4 | 3 | 3 | 3 | |
| 3 | 3 | 3 | 5 | 5 | 5 | 6 | 6 | 6 | 6 | 0 | 0 | 0 | 6 | 6 | 6 | 0 | 0 | ||
| F | F | F | F | F | F | F | F | F | F | F | F | F | F | F | F | F | F |
