Consider a paging architecture with a logical address space


Consider a paging architecture with a logical address space of 256 pages with a 256 byte page size, mapped onto a physical memory of 64 frames. Assume that it takes 50ns to access a memory page, and TLB lookup time is 2ns.

  1. How many bits are required in the logical address and how much virtual memory can a process on this machine address?
  2. How many bits are required in the physical address and how much physical memory can an OS on this machine use?
  3. What is the optimal number of hierarchical page table levels would you recommend for this architecture (assume that each PTE requires 2 bits to store the valid and protection bits).
  4. How long does a paged memory reference take in case of a TLB miss? If the TLB has a 0.9 hitrate, what is the effective access time?

 

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Consider a paging architecture with a logical address space
Reference No:- TGS0646712

Expected delivery within 24 Hours