Consider a paging system with the page table stored in memory. A memory reference takes 50 ns. If we add a TLB, and 75 percent of all page-table references are found in the TLB, what is the average time to access memory? (This is also called the effective memory access time.) Assume that finding a page-table entry in the TLB takes 2 ns, if the entry is present.)

Consider a paging system with the page table stored in memory. A memory reference takes 50ns. If we add a TLB, and 75 percent of all page-table references are found in the TLB, what is the average time to access memory? (This is also called the effective memory access time.) Assume that finding a page-table entry in the TLB takes 2 ns, if the entry is present.)