search
Log In
0 votes
55 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. Assume that a process is allocated $3=\text{three}$ frames, and the reference string contains page numbers from the set $0, 1, 2, 3.$
in Operating System 55 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
78 views
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.’’ What is that attribute for the FIFO algorithm? LRU algorithm? Optimal algorithm? Give the generic algorithm for these page replacement algorithms.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 78 views
0 votes
0 answers
2
192 views
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$ ... to a read request to page $4.$ Show the contents of the new table entries. Explain. (You can omit entries that are unchanged.)
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 192 views
0 votes
1 answer
3
0 votes
0 answers
4
125 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).$ At subsequent clock ticks, the values are $1011, 1010, 1101, 0010, 1010, 1100,$ and $0001.$ If the aging algorithm is used with an $8-bit$ counter, give the values of the four counters after the last tick.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 125 views
...