Answered step by step
Verified Expert Solution
Question
1 Approved Answer
2. (17 pts) Repeat Question 1 but assume we have a fully associative cache with one- word block and a total size of 8 blocks.
2. (17 pts) Repeat Question 1 but assume we have a fully associative cache with one- word block and a total size of 8 blocks. Use LRU replacement. a. Explain how a 32-bit address should be divided into Tag and Offset fields. b. For the same byte-address sequence, fill in the table below Address Binary Tag Hit/Miss Replacement? LRU order pattern 0x018 0x218 0x2FC 0x218 0x018 0x246 0x180 0x241 0x247 0x219 Note: you must use decimal values for Tag. LRU order should list all blocks in cache, represented by their Tags, from most recent to least recent. 2. (17 pts) Repeat Question 1 but assume we have a fully associative cache with one- word block and a total size of 8 blocks. Use LRU replacement. a. Explain how a 32-bit address should be divided into Tag and Offset fields. b. For the same byte-address sequence, fill in the table below Address Binary Tag Hit/Miss Replacement? LRU order pattern 0x018 0x218 0x2FC 0x218 0x018 0x246 0x180 0x241 0x247 0x219 Note: you must use decimal values for Tag. LRU order should list all blocks in cache, represented by their Tags, from most recent to least recent
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started