• •   

     
     
     

     
  • 
    

 

 

Assume you have a small system whose memory is of size 64MB. Further assume that this is a system uses paging and each page is of size 1KB. Note: 1KB = 210 Bytes, 1MB = 210 KB. We consider a single level page table. Question 1 (6 points). 1) For the virtual addresses, how many bits are required for the VPN? 2) How many bits are required in the offset to address every byte in each page? You are required to show your calculations or explanations. Question 2 (6 points). 1) Considering that we need to cover at least the PFN in each page table entry (PTE), what are the minimum bytes required for each PTE? 2) Thereafter, what is the total size (in KB) of the page table for each process? You are required to show your calculations or explanations. Now we would like to change the single-level page table in above to a multi-level page table. We assume that all pages for the process are allocated. Question 3 (6 points). 1) How many PTEs can we store in each page? 2) How many pages do we need to store the innermost page table entries? You are required to show your calculations or explanations. Question 4 (6 points). 1) How many total pages do we need to store the multi-level page table for the process, assuming the page directory entry is of the same size as the PTE? 2) how many bits are required for the page directory index (i.e., master page number)? You are required to show your calculations or explanations.