1. Answers to the VM Problems Spring 2015

2. First question A computer has 32 bit addresses and a virtual memory with a page size of 8 kilobytes.  How many bits are used by the byte offset? 13 bits (because 8KB = 2 13 bits)  What is the size of a page table? 4GB/8KB bytes × 4 = 2MB (32 bit addresses allow processes to address 4GB of virtual memory and each page table entry occupies 4 bytes)

3. Second question A computer system has 32-bit addresses and a page size of 4 kilobytes.  What is the maximum number of pages a process can have? 1M pages (2 32 /2 12 = 2 32 - 12 = 2 20 )  How many bits of the virtual address will remain unchanged during the address translation process? 12 bits (because 4KB = 2 12 bits)

4. Third question A very old virtual memory system has 512 MB of main memory, a virtual address space of 4 GB and a page size of 2KB. Each page table entry occupies 4 bytes.  How many bits of the virtual address will remain unchanged by the address translation process? 11 bits  What is the size of a page table? 4GB/2KB × 4B = 8MB  How many page frames are there in main memory? 512MB/2KB = 256K frames

5. Fourth question (I) A computer will never have a page referenced bit and a missing bit.  FALSE (different functions) The dirty bit indicates whether a page has been recently accessed.  FALSE (it indicates whether the page has been modfied) A page fault rate of one fault per one thousand references is a good page fault rate.  FALSE (it still too high)

6. Fourth question (II) A TLB miss rate of one miss per one thousand references is a good miss rate.  TRUE (Cheaper TLB misses) The FIFO page replacement policy has an excessive overhead.  FALSE (It has very low overhead)

7. Fifth question Which page table organization allows entire page tables to reside in main memory?  Hashed page tables How is it possible?  They only contain mappings for the pages that are in memory.