• edited by
23,122 views
54 54 votes
Assume that for a certain processor, a read request takes $50\:\text{nanoseconds}$ on a cache miss and $5\:\text{nanoseconds}$ on a cache hit. Suppose while running a program, it was observed that $80\%$ of the processor's read requests result in a cache hit. The average read access time in nanoseconds is ______.

7 Answers

0 0 votes

ok first  Remember ,

Miss Time = Miss Penalty + Hit Time 

here three main formula all are same 

AMAT = hit time +miss rate * miss penalty

AMAT = Hit ratio * hit time + (1-hit time)* miss time 

AMAT = H (Tc) + (1-H)(Tc + Tm)  

where 

H =hit ratio 

Tc = cache access time 

Tm = miss penalty 

In the given question it  directly  mention the miss time, means Miss penalty+Hit time = 50 nsec
         

 

by putting this values in given formula 1 
Miss penalty = 50 - hit time = 50 - 5 = 45 

AMAT  = 5 + (1 - 0.8)*45 = 5+ 9 = 14 ns




by formula 2

AMAT  = 0.8 * 5 + ( 1- 0.8 ) * 50 = 4 + 10 = 14ns 




by formula 3 

Tc= 5 ns 

Tm = Miss Penalty = 45 

ATMT = 0.8 * 5 + (1 - 0.8 )(5 + 45)  = 14 ns 

 


 

Answer:
Position:
Show:

Related questions

79 79 votes
5 answers 5 answers
28.4k
28.4k views
go_editor asked Feb 12, 2015
28,414 views
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack...
53 53 votes
4 answers 4 answers
18.0k
18.0k views
go_editor asked Feb 12, 2015
17,994 views
Consider the C program below#include <stdio.h int *A, stkTop; int stkFunc (int opcode, int val) { static int size=0, stkTop=0; switch (opcode) { case -1: size = val; brea...
65 65 votes
9 answers 9 answers
15.6k
15.6k views
go_editor asked Feb 12, 2015
15,611 views
Perform the following operations on the matrix $\begin{bmatrix} 3 & 4 & 45 \\ 7 & 9 & 105 \\ 13 & 2 & 195 \end{bmatrix}$Add the third row to the second rowSubtract the th...
74 74 votes
9 answers 9 answers
34.5k
34.5k views
go_editor asked Feb 12, 2015
34,510 views
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}...