Operating Systems207810 marksNumerical: Page replacement algorithmsVideo solutionPage Replacement Algorithms
Why OPR is best but not practically feasible page replacement algorithm? Calculate the number of page faults for OPR, LRU and Clock page replacement algorithm for the reference string: 1, 3, 4, 2, 3, 5, 4, 3, 1, 2, 4, 6, 3, 2, 1, 4, 2. Assume the memory size is 3.
Why OPR is best but not practically feasible page replacement algorithm? Calculate the number of page faults for OPR, LRU and Clock page replacement algorithm for the reference string: 1, 3, 4, 2, 3, 5, 4, 3, 1, 2, 4, 6, 3, 2, 1, 4, 2. Assume the memory size is 3.[10]
Video solutionOPR LRU and Clock Page Replacement Comparison2:43
Speed
Checked against the model answer before publishing.
- Reference String: 1, 3, 4, 2, 3, 5, 4, 3, 1, 2, 4, 6, 3, 2, 1, 4, 2 - Number of Frames: 3 --- Optimal Page Replacement (OPR) replaces the page that will not be used for the longest period of time in the future. Why BEST: - Yields the minimum possible page faults for a given string and frame cou...