George Mason University Computer System Questions
I’m working on a computer systems writing question and need guidance to help me learn.
1. For the following Paging configuration discuss what must be done to ensure a processes address space is not violated.
2. How many memory references would it take to fetch a word from memory if the process requires 80 G of memory and the system has 8 G of physical memory? Page size is 2k.
3. Describe how a page fault is handled?
4. Given the page reference string 1 2 3 2 1 5 2 4 5 3 2 1 5 2 3 4 5
Show the time sequence of memory that has 3 frames for FIFO, Optimal, LRU, and Second Chance. Indicate for each time whether a page fault occurred. How many page faults occurred for each algorithm?
5. Repeat the question above for 4 frames.
