edited by
888 views
0 votes
0 votes

Suppose that the $\text{WSClock}$ page replacement algorithm uses a $\tau$ of two ticks, and the system state is the following:

where the three flag bits $V, R,$ and $M$ stand for Valid, Referenced, and Modified, respectively.

  1. If a clock interrupt occurs at tick $10,$ show the contents of the new table entries. Explain. (You can omit entries that are unchanged.)
  2. Suppose that instead of a clock interrupt, a page fault occurs at tick $10$ due to a read request to page $4.$ Show the contents of the new table entries. Explain. (You can omit entries that are unchanged.)
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
admin asked Oct 26, 2019
725 views
In the $\text{WSClock}$ algorithm of Fig. $3-20(c),$ the hand points to a page with $R = 0.$ If $\tau = 400,$ will this page be removed? What about if $\tau = 1000?$
0 votes
0 votes
0 answers
4