487 views
0 votes
0 votes

A student has claimed that ‘‘in the abstract, the basic page replacement algorithms (FIFO, LRU, optimal) are identical except for the attribute used for selecting the page to be replaced.’’

  1. What is that attribute for the FIFO algorithm? LRU algorithm? Optimal algorithm?
  2. Give the generic algorithm for these page replacement algorithms.

Please log in or register to answer this question.

Related questions

931
views
0 answers
0 votes
admin asked Oct 26, 2019
931 views
Suppose that the $\text{WSClock}$ page replacement algorithm uses a $\tau$ ... of the new table entries. Explain. (You can omit entries that are unchanged.)
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.