We have a 8-lines of L1 data cache. Let us assume each line has 256 bits and memory addresses have 16 bits of width, with byte-addressable memory. Indexing the cache is implemented by lowest-order bits. a) Determine the number of tag, index and offset bits. b) Which types of bits does the cache tags contain? c) What is the total number of bits necessary to apply the level 1 data cache?
We have a 8-lines of L1 data cache. Let us assume each line has 256 bits and memory addresses have 16 bits of width, with byte-addressable memory. Indexing the cache is implemented by lowest-order bits.
- a) Determine the number of tag, index and offset bits.
- b) Which types of bits does the cache tags contain?
- c) What is the total number of bits necessary to apply the level 1 data cache?
- d) Let us assume the processor accesses data addresses below when cache is initially
empty. Show the hits and misses in the level 1 data cache
0x0039: 0000 0000 0011 1001
0x103B: 0001 0000 0011 1011
0x954C: 1001 0101 0100 1100
0xFFF5: 1111 1111 1111 0101
0xBEEF: 1011 1110 1110 1111
0x4360: 0100 0011 0110 0000
0x02DF: 0000 0010 1101 1111
0x8065: 1000 0000 0110 0101
0x9528: 1001 0101 0100 1000
e)Let us assume that the level 1 data cache has a hit rate of 30% on your application,
an access time of a single cycle, and a miss penalty to memory will be of 30 cycles.
What will the AMAT time?
f)We want to increase the performance and we add a L2 cache to the system, what
should the access time of the L2 cache with a hit rate of 50% in order to reduce the
AMAT?
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
