Podcast
Questions and Answers
In the context of page replacement policies, what is the optimal policy if we had knowledge of the future page accesses?
In the context of page replacement policies, what is the optimal policy if we had knowledge of the future page accesses?
- Always replace the oldest page in memory
- Choose the page which will be referenced farthest in the future (correct)
- Replace the page that has not been used recently
- Select the most frequently used page for replacement
Which replacement policy takes into account the recent references and uses the concept of locality of references?
Which replacement policy takes into account the recent references and uses the concept of locality of references?
- FIFO (First-In-First-Out)
- NRU (Not-Recently-Used) (correct)
- Second Chance
- Clock Algorithm(s)
What hardware support is available for each page frame to aid in replacement policies?
What hardware support is available for each page frame to aid in replacement policies?
- Least-Recently-Used bit (LRU)
- Referenced Bit (R) and Modified Bit (M) (correct)
- Replacement Bit (RB) and Eviction Bit (EB)
- Frequently Used bit (FU) and Recently Used bit (RU)
Which replacement policy involves selecting the page that has not been used recently for replacement?
Which replacement policy involves selecting the page that has not been used recently for replacement?
What is the purpose of knowing about the optimal policy in page replacement?
What is the purpose of knowing about the optimal policy in page replacement?
Which replacement policy focuses on selecting the least frequently used page for replacement?
Which replacement policy focuses on selecting the least frequently used page for replacement?
Which algorithm removes a page at random from the lowest numbered non empty class?
Which algorithm removes a page at random from the lowest numbered non empty class?
In the FIFO - Second Chance algorithm, what happens to old pages that have been used recently (R=1)?
In the FIFO - Second Chance algorithm, what happens to old pages that have been used recently (R=1)?
What does the 'hand' of the clock algorithm point to when required to evict a page with R=0?
What does the 'hand' of the clock algorithm point to when required to evict a page with R=0?
Which page replacement policy replaces the page in memory that has been unused for the longest time?
Which page replacement policy replaces the page in memory that has been unused for the longest time?
What is one possible implementation of the LRU policy that involves updating a list of pages after every memory reference?
What is one possible implementation of the LRU policy that involves updating a list of pages after every memory reference?
What characteristic distinguishes the Not Recently Used (NRU) algorithm from other page replacement policies?
What characteristic distinguishes the Not Recently Used (NRU) algorithm from other page replacement policies?
In the context of page replacement policies, what is meant by 'dirty bit'?
In the context of page replacement policies, what is meant by 'dirty bit'?
What drawback is associated with the FIFO - Second Chance algorithm?
What drawback is associated with the FIFO - Second Chance algorithm?
'Hit ratio' is a metric commonly used to measure what aspect of page replacement policies?
'Hit ratio' is a metric commonly used to measure what aspect of page replacement policies?
'Locality of Reference' implies that...
'Locality of Reference' implies that...
Flashcards are hidden until you start studying
