Question: (d) (e) Briefly describe how you could implement the LRU page replacement algorithm in hardware. Is this algorithm the best in all cases? Why or

 (d) (e) Briefly describe how you could implement the LRU page

(d) (e) Briefly describe how you could implement the LRU page replacement algorithm in hardware. Is this algorithm the best in all cases? Why or why not? [4 Marks] Consider the following page reference string: 1, 3, 1, 2, 3, 4, 2, 3, 1, 2, 3, 4 Assume there are three (3) physical page frames that are initially empty. Show how many page faults would occur for the Least Recently Used (LRU) page replacement algorithms. Show the details of your work. [6 Marks] (f) During the time interval t1 - t2, the following virtual page accesses are recorded for the three processes P1 and P2, respectively. P1: 0, 0, 1, 2, 1, 2, 1, 1, 0 P2: 0, 100, 101, 102, 103, 0, 1, 2, 3 (i) (ii) What is the working set for each of the above three processes for this time interval? [2 marks] What is the cumulative memory pressure on the system during this interval? [1 Mark] (9) Consider a swapping system for which the free list indicates the following blocks of memory (a) 10KB, (b) 15KB, (C) 12KB, (d) 21KB, (e) 30KB, (f) 9KB, (g) 16KB (in that order). Assume that requests for blocks of memory of 12Kb, 9Kb and 25Kb come in (in that order). Which partitions would be allocated for the first fit, next fit, and best fit algorithm? [3 Marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!