Register

Galvin Edition 9 Exercise 9 Question 23 (Page No. 454)

360 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.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
akash.dinkar12 asked Mar 21, 2019
1,182 views
Galvin Edition 9 Exercise 9 Question 25 (Page No. 454)
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.
Discuss situations in which the most frequently used ($MFU$) page replacement algorithm generates fewer page faults than the least recently used ($LRU$) page-replacement ...
User Avatar
0 votes
0 votes
1 answer
2
akash.dinkar12 asked Mar 21, 2019
519 views
Galvin Edition 9 Exercise 9 Question 24 (Page No. 454)
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.
Discuss situations in which the least frequently used ($LFU$) page replacement algorithm generates fewer page faults than the least recently used ($LRU$) page-replacement...
User Avatar
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Mar 22, 2019
309 views
Galvin Edition 9 Exercise 9 Question 37 (Page No. 456)
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’t scale well with multiple CPUs. What could be done to address this scalability issue?
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’t scale w...
User Avatar
Link Copied!