Question: Consider a paging scheme with the page table stored in memory. a. If memory reference takes 20 nanoseconds, how long does a paged memory reference
Consider a paging scheme with the page table stored in memory.
a. If memory reference takes 20 nanoseconds, how long does a paged memory reference take without a Translation Lookaside Buffer (TLB)?
b. If we add a TLB and 75% of all page table references are found in the TLB, what is the effective memory reference time? (Assume that finding a page table entry in the TLB takes negligible time.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
