Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

4. (8 points) Assume that we have a computer that uses virtual memory. It has a TLB, a cache, and a page table. Furthermore, we

image text in transcribed

4. (8 points) 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 5 ns A cache hit requires 12 ns A memory reference requires 25 ns .A disk reference requires 200 ms (this includes updating the page table, cache, and TLB) The TLB hit ratio is 90% The cache hit rate is 98% The page fault rate is .001% .On a page fault, the page is fetched from disk, and access is restarted. In other words, you must re-do the access after the disk block is retrieved (see Slide 57 in Chapter 6) 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 57 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

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Harness The Power Of Big Data The IBM Big Data Platform

Authors: Paul Zikopoulos, David Corrigan James Giles Thomas Deutsch Krishnan Parasuraman Dirk DeRoos Paul Zikopoulos

1st Edition

0071808183, 9780071808187

More Books

Students also viewed these Databases questions