edited by
3,729 views
1 votes
1 votes

Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $0.5$ ns, $5$ ns and $100$ ns respectively. The hit rates of Level $1$ and Level $2$ caches are $0.7$ and $0.8$ respectively. What is the average access time of the system ignoring the search time within the cache?

  1. $35.20$ ns
  2. $7.55$ ns
  3. $20.75$ ns
  4. $24.35$ ns
edited by

3 Answers

1 votes
1 votes
ignoring search time with in the cache ==> this statement tells us to use parallel access.

$T_{avg\;access} = H_1.T_1 + \color{red}{(}1-H_1 \color{red}{)} \color{red}{(} \color{green}{H_2 . T_2 + (1-H_2).T_M} \color{red}{)}$

$T_{avg\;access} = (0.7*0.5) + \color{red}{(}0.3\color{red}{)} \color{red}{(} \color{green}{ (0.8*5) + (0.2).100} \color{red}{)}$

$T_{avg\;access} = (0.35) + \color{red}{(}0.3\color{red}{)} \color{red}{(} \color{green}{ 4 + 20} \color{red}{)}$

$T_{avg\;access} = 0.35 + 7.2 = 7.55\;ns$
0 votes
0 votes
Average access time = level 1 hit rate( level 1 access time) + (level1 miss rate)(level 2 hit rate(level 2 access time)+ (level 1 miss rate)( level 2 miss rate) (main memory access time)
Average access time = 0.7(0.5) + 0.3(0.8)(5) + 0.3(0.2)(100)
Average access time = 7.55 ns
Answer:

Related questions

1 votes
1 votes
0 answers
3
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,388 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$