Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Q 2 ( 2 0 ) : a . Let us use a translation look - aside buffer called TLB that is fast - lookup
Q: a Let us use a translation lookaside buffer called TLB that is fastlookup hardware cache with
the access time can be neglected or in other words, zero. We assume the average memory access time is
If the hit ratio is what is the effective access time EAT What is the slowdown ratio due to
miss?
If we get the EAT is greater than the memory access time, what is the hit ratio we desire?
b Let us consider a similar solution but the fast cache access needs time as well. Assume it needs
Also assume the memory access is So all access has two accesses, one for table lookup and one
for data and instruction. The only difference is that one for hit it needs while for miss is needs
We can calculate the effective access time like a as well. If the hit ratio is what is the EAT? What is
the slowdown ratio due to miss? If the EAT is greater than the hit memory access time, what is the
hit ratio
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started