552 views

1 Answer

0 votes
0 votes

Consider the following sequence of memory accesses in a system that can hold four pages in memory: 1 1 2 3 4 5 1. When page 5 is accessed, the least frequently used page-replacement algorithm would replace a page other than 1, and therefore would not incur a page fault when page 1 is accessed again. On the other hand, for the sequence “1 2 3 4 5 2,” the least recently used algorithm performs better.

Ref: 

CHAPTER 9

Related questions

1.2k
views
1 answers
0 votes
akash.dinkar12 asked Mar 21, 2019
1,227 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.
400
views
0 answers
0 votes
akash.dinkar12 asked Mar 21, 2019
400 views
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 ... behavior:$a$. Pointer is moving fast.$b$. Pointer is moving slow.
340
views
0 answers
0 votes
akash.dinkar12 asked Mar 22, 2019
340 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,395 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 ?