Question

3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles
3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles


- 10 points 1. [3 +2+5 ] Suppose we have a 2KB direct-mapped data cache with 4-byte blocks. (a) Show how a 32-bit memory addr
2. 13+2+5-10 points] Suppose we have a 2KB 8-way set-associative data cache with 32-byte blocks. a) Show how a 32-bit memory
3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles. The cache in Problem 1 has a miss penalty of 15 cycles. The one in Problem 2 has a miss penalty of 25 cycles. Calculate the total time taken (in cycles) for all accesses, for each cache. Which cache is better- the one in Problem 1 or Problem 2?
3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles. The cache in Problem 1 has a miss penalty of 15 cycles. The one in Problem 2 has a miss penalty of 25 cycles. Calculate the total time taken (in cycles) for all accesses, for each cache. Which cache is better- the one in Problem 1 or Problem 2?
- 10 points 1. [3 +2+5 ] Suppose we have a 2KB direct-mapped data cache with 4-byte blocks. (a) Show how a 32-bit memory address is divided into tag, index and offset. Show clearly how many bits are in each field. (b) How many total bits are there in this cache? (c) Consider this address trace: 0x404c4958 0x404c46d8 0x404c4944 0x404c86d8 0x40544944 For this cache, for each address in the above trace, show the tag, index and offset in binary. Indicate whether each reference is a hit or a miss. What is the miss rate?
2. 13+2+5-10 points] Suppose we have a 2KB 8-way set-associative data cache with 32-byte blocks. a) Show how a 32-bit memory address is divided into tag, index and offset. Show clearly how many bits are in each field. (8 points) b) How many total bits are there in this cache? c) Consider this address trace: 0x48034760 0x48014554 0x48014560 0x48014760 0x48014558 For this cache, for each address in the above trace, show the tag, index and offset in binary. Indicate whether each reference is a hit or a miss. What is the miss rate? Doblem 2 Sunpose bo
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Cache. Stie 2kg Formula ltseel. Block Size 2.2 B Founda used. → 32 bits 2 blts 24bita (b bib the CeHwwuld be 2x j.е., 214 bin bunaj nd MisA ouse Mae enz, Mus these oldao be CacteS» HLw Dl b fMiuiBlok Sure ELL 2.3 Number 앙 den 2-2 6 Total bih aehe - Cnte. hbSeE しら . Dx 48o1 45 5F Miss ‘ Qq sepD DDDb5 eLt Pen both CacHe j i Cach oiu be

Add a comment
Know the answer?
Add Answer to:
3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles. The cache in Problem 1 has a miss penalty of 15 cycles. The o...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT