search
Log In
0 votes
134 views
If $FIFO$ page replacement is used with four page frames and eight pages, how many page faults will occur with the reference string $0172327103$ if the four frames are initially empty? Now repeat this problem for$ LRU.$
in Operating System 134 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
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.$
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 55 views
...