edited by
930 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

487
views
0 answers
0 votes
admin asked Oct 26, 2019
487 views
A student has claimed that in the abstract, the basic page replacement algorithms (FIFO, LRU, optimal) are identical except for the ... algorithm? Optimal algorithm?Give the generic algorithm for these page replacement algorithms.
794
views
1 answers
0 votes
admin asked Oct 26, 2019
794 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?$
377
views
0 answers
1 votes
admin asked Oct 26, 2019
377 views
Give a simple example of a page reference sequence where the first page selected for replacement will be different for the clock and $LRU$ page replacement algorithms. ... reference string contains page numbers from the set $0, 1, 2, 3.$
486
views
0 answers
0 votes
admin asked Oct 26, 2019
486 views
A small computer on a smart card has four page frames. At the first clock tick, the $R$ bits are $0111\:\: ($page $0$ is $0,$ the rest are $1).$ ... is used with an $8-bit$ counter, give the values of the four counters after the last tick.