Question - Short answers question from chapter 9 - Virtual Memory.
1. Virtual memory allows the computer to overallotcate memory. What are some of the benefits of this as well as the pitfalls?
2. Use the LRU page replacement algorithm to determine how many page faults occur with the following reference string. Assume we have 3 available frames. Show your steps.
3. What are the two ways in which LRU can be implemented? What are the pitfalls of each implementation?
4. Why can we not implement Optimal Page Replacement?
5. Describe the process of how demand paging enables virtual memory. What kind of hardware support is needed?
6. What is Belady's Anomaly? What kind of algorithms discussed in class are not affected by it?
7. How is the Second Chance page replacement algorithm different from FIFO?
8. Why is it better for some special applications to manage their own virtual memory implementation?
TEXTBOOK - OPERATING SYSTEM CONCEPTS WITH JAVA 8TH EDITION BY ABRAHAM SILBERSCHATZ, PETER BAER GALVIN, GREG GANGE
CHAPTER 9 - VIRTUAL MEMORY.