Question: Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacements policy. Please draw diagrams for each policy and calculate the number of faults for each policy respectively. Which is best, which is worst
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
