Operating Systems20795 marksNumerical: page replacement faultsOptimal page replacement algorithm
Consider the following page reference string: 3,2,1,3,4,2,8,9,7,4,2,9,8,3. Calculate the total number of page faults for Optimal and LRU page replacement algorithms using a 4 page frame.
Consider the following page reference string: 3,2,1,3,4,2,8,9,7,4,2,9,8,3. Calculate the total number of page faults for Optimal and LRU page replacement algorithms using a 4 page frame. [5]
- Reference string: 3, 2, 1, 3, 4, 2, 8, 9, 7, 4, 2, 9, 8, 3 (14 references) - Frames = 4 --- Replace the page whose next use is furthest in the future. Step Page Frames after the reference Fault? Replacement reasoning ----------------------------------------------------------------------- 1 3 {3...