1/11
Flashcards covering page faults, demand paging, virtual memory advantages, and page replacement algorithms like FIFO, OPT, and LRU based on Quiz #9.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
The instruction that causes a __________ needs to be re-executed after the fault has been handled.
page fault
__________ initially allows a parent and child process to share the same pages.
Copy-On-Write (COW)
In __________, a page is loaded in memory only when it is needed during execution.
demand paging
One advantage of virtual memory is that a program can be much __________ than the size of physical memory.
larger
Virtual memory allows programmers to concentrate on programming the problem instead of worrying about the amount of __________ available.
physical memory
Virtual memory provides a way to execute a program that is only __________ loaded in memory.
partially
The __________ bit identifies a page that has been modified since it was loaded.
dirty (modify)
__________ page replacement is used mostly for comparison with other page-replacement schemes.
Optimal
Using the FIFO replacement algorithm on the page access string 12342341211314 with three frames results in __________ page faults.
8
Under FIFO, the final configuration of three frames for the reference string 1 2 3 4 2 3 4 1 2 1 1 3 1 4 is __________.
3, 1, 4
After the OPT algorithm is applied to the reference string 1 2 3 4 2 3 4 1 2 1 1 3 1 3 with three page frames, the final configuration is __________.
1, 2, 3
Given the reference string 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and three page frames, the final configuration after the LRU algorithm is applied is __________.
3, 1, 4