399 views
0 votes
0 votes
Assume that you are monitoring the rate at which the pointer in the clock algorithm moves. (The pointer indicates the candidate page for replacement.) What can you say about the system if you notice the following behavior:

$a$. Pointer is moving fast.
$b$. Pointer is moving slow.

Please log in or register to answer this question.

Related questions

1.2k
views
1 answers
0 votes
akash.dinkar12 asked Mar 21, 2019
1,226 views
Discuss situations in which the most frequently used ($MFU$) page replacement algorithm generates fewer page faults than the least recently used ($LRU$) page-replacement algorithm. Also discuss under what circumstances the opposite holds.
552
views
1 answers
0 votes
akash.dinkar12 asked Mar 21, 2019
552 views
Discuss situations in which the least frequently used ($LFU$) page replacement algorithm generates fewer page faults than the least recently used ($LRU$) page-replacement algorithm. Also discuss under what circumstances the opposite holds.
339
views
0 answers
0 votes
akash.dinkar12 asked Mar 22, 2019
339 views
The slab-allocation algorithm uses a separate cache for each different object type. Assuming there is one cache per object type, explain why this scheme doesn ... with multiple CPUs. What could be done to address this scalability issue?
1.4k
views
1 answers
0 votes
akash.dinkar12 asked Mar 22, 2019
1,394 views
Consider the parameter$\triangle$ used to define the working-set window in the working-set model. When $\triangle$ is set to a small value, what is the effect on the ... ? What is the effect when $\triangle$ is set to a very high value ?