620 views
1 1 vote

 

I want to understand why in case of cache miss, we don’t consider cache search time?? in case if it is hit, we have hit cache anyway, but in case of failure, we are still accessing cache, and when unable to find it there, only then we load it from main memory. So why is in the solution, cache time not included for cache miss??

1 Answer

0 0 votes
According to the solution which you have specified, the type of access considered is simultaneous access.
But in the question, they have not mentioned the type of access which means that we need to consider hierarchial access [ by default ].

So, given tc=3ns, cache size=1MB, block size=256 B, word size=64 bits=8 bytes, h=0.94
each block contains 256/8 = 32 words
to fetch the first word it takes 20ns and the remaining 5ns each
therefore, Tm=20+(31*5)=175 ns
Avg. memory access time= h*tc + (1-h)*(tc+Tm) = (0.94*3)+(0.06)*(3+175) = 13.5 ns
Position:
Show:

Related questions

2 2 votes
1 1 answer
4.4k
4.4k views
go_editor asked Nov 20, 2020
4,384 views
Consider a machine with a byte addressable main memory of $2^{16}$ bytes and block size of $8$ bytes. Assume that a direct mapped cache consisting of $32$ lines is used w...
0 0 votes
1 1 answer
3.5k
3.5k views
go_editor asked Nov 20, 2020
3,496 views
The following program is stored in memory unit of the basic computer. What is the content of the accumulator after the execution of program? (All location numbers listed ...
1 1 vote
2 2 answers
3.0k
3.0k views
go_editor asked Nov 20, 2020
3,008 views
A non-pipeline system takes $50$ns to process a task. The same task can be processed in six-segment pipeline with a clockcycle of $10$ns. Determine approximately the spee...
1 1 vote
1 1 answer
1.9k
1.9k views
go_editor asked Nov 20, 2020
1,897 views
Which of the following statements with respect to $\text{K}$-segment pipelining are true?Maximum speedup that a pipeline can provide is $k$ theoreticallyIt is impossible ...