Question: In virtual memory, suppose a working set algorithm with a window size w of 3 is used. Suppose that LRU is used to decide which

In virtual memory, suppose a working set algorithm with a window size w of 3 is used. Suppose that LRU is used to decide which page is unloaded. Suppose that R = 1 2 0 3 1 2 0 3 0 1 2 3 4. What is the behavior of the working set algorithm? How many page faults do you have?

Suppose that a hard disk has tracks 0:99. Its head is currently at track 75, data requests are 23, 87, 36, 93, 66. If circular look is used, how many steps will be needed?

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!