In a paged memory system where the entire process is loaded in memory (not demand paging), you have a 35-entry TLB. Assume that the probabibility of a memory access being in any one page is the same. If the TLB search time is 5nsec and memory access time is 50nsec, how large is the process in pages if the effective access time is 70nsec?

Answer rating: 100% (QA)

To determine the size of the process in pages we need to work backward from the given information ta... View the full answer