Lab3_OS

1. 1. The goal of the LRU page eviction strategy?

• Keep the Least Recently Used pages in memory

• Send the working set to disk

• Send the Least Recently Used pages to disk

• Keep the working set in memory

2. 2. In the memory labwork, the implementation of lru_select()

• looks for the page with the maximal access date

• select a page in a FIFO list

• select a random page

• looks for the page with the minimal access date

3. 3. When a page is selected by LRU for replacement?

• this page must be loaded in memory

• this page must be sent to disk

4. 4. When a page fault occurs, if memory is not full

• a LRU selection will be operated

• a page will be loaded from disk

• a page will be allocated in memory

• a page will be sent to disk

5. 5. When a page fault occurs

• there will be possibly be a LRU selection

• a page will always be loaded

• a page will always be sent to disk

• there will always be a LRU selection

6. 6. The LRU evection strategy consists in

• choosing the pages which should be sent to disk

• selecting the pages which were not recently accessed

• selecting the pages which were recently accessed

• choosing the pages which should be loaded from disk

8. 8. When a page fault occurs

• there will always be a LRU selection

• there will be a LRU selection only if memory is empty

• there will be a LRU selection only if memory is full

9. 9. When a page fault occurs

• this is because memory is empty

• this is because the page is in memory

• this is because memory is full

• this is because the page is not in memory

10. 10. When a page is selected by LRU for replacement

• this page can still be accessed

• this page must be invalidated in the page table

(*) The LRU eviction strategy

• is used to make space available in main memory

• is used to make space available on disk

• selects the pages which should be sent to disk

• selects the pages which should be loaded from disk