Assume you have a byte-addressable machine that uses 32-bit word (integers are 32-bit) and you are storing the following informa
1 answer:
You might be interested in
Answer:
A. index bits = 2, tag bits = 2, block offset bits = 1, it is a miss.
B. index bits = 2, tag bits = 1, block offset bits = 0, it is a hit
C. the miss rate is 0
Explanation:
a. number of blocks = 12
number of blocks per set = 3
number of set = number of blocks / number of blocks per set = 12/3 = 4
word size = 24
block size = 2
the block offset = block size
= 2 = 1
the index bits = number of set =
4 = 2
the tag bits = ( word size) - offset - index = (
24) -2 - 1 = 5 -2 - 1 = 2
b. word size = 8
block size = 1
the block offset = block size
= 1 = 0
the index bits = number of set =
4 = 2
the tag bits = ( word size) - offset - index = (
8) -2 - 1 = 3 - 0- 2= 1