Question: For a cache with the following characteristics: The memory is byte-addressable. Memory accesses are to 1-byte words (not to 4-byte words). Addresses are 13 bits
For a cache with the following characteristics: The memory is byte-addressable. Memory accesses are to 1-byte words (not to 4-byte words). Addresses are 13 bits wide. The cache is two-way set associative (E=2) with a 4-byte block size (B=4) and eight sets (S=8). And the following contents (all numbers in hexadecimal notation):
| Set | Line 0 | Line 1 | ||||||||||
| Index | Tag | Valid | Byte 0 | Byte 1 | Byte 2 | Byte 3 | Tag | Valid | Byte 0 | Byte 1 | Byte 2 | Byte 3 |
| 0 | 90 | 1 | 38 | 89 | 21 | E2 | 00 | 0 | ||||
| 1 | 54 | 1 | 40 | 2F | D0 | 23 | 83 | 1 | 01 | DA | 72 | 0C |
| 2 | AB | 0 | 1F | 0 | ||||||||
| 3 | 48 | 0 | 23 | 1 | 92 | 16 | 56 | 78 | ||||
| 4 | 7C | 1 | 81 | 09 | A3 | 18 | 50 | 1 | CF | 41 | 2E | A0 |
| 5 | 17 | 1 | F1 | CD | 92 | 63 | 29 | 0 | ||||
| 6 | 19 | 1 | 2A | 5C | 37 | F8 | 67 | 0 | ||||
| 7 | 43 | 0 | ED | 1 | 31 | 52 | F6 | B0 |
List all of the hexadecimal memory addresses that will hit in set 0. Show your work.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
