Question: Assume that we have a computer that uses virtual memory. It has a TLB , a cache, and a page table. Furthermore, we can assume
Assume that we have a computer that uses virtual memory. It has a TLB
a cache, and a page table. Furthermore, we can assume the following:
A TLB hit requires ns
A cache hit requires ns
A memory reference requires ns
A disk reference requires ms this includes updating the page table, cache,
and TLB
The TLB hit ratio is
The cache hit rate is
The page fault rate is
On a page fault, the page is fetched from disk, and access is restarted. In other
words, you must redo the access after the disk block is retrieved see Slide in
Chapter
All references are sequential no overlap, nothing done in parallel
For each of the following, provide the total time taken for the access. Again, you may
want to use the logic of Slide as a guide.
a TLB hit, cache hit
b TLB miss, page table hit, cache hit
c TLB miss, page table hit, cache miss
d TLB miss, page table miss
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
