Below is a sequence of 32-bit memory address references observed during the execution of an application, and given as word addre
sses.
3, 180, 43, 2, 191, 88, 190, 14, 181, 44, 186, 253
For each of these references, identify the binary address, the tag, and the index given a direct mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty
3, 180, 43, 2, 191, 88, 190, 14, 181, 44, 186, 253
For each of these references, identify the binary address, the tag, and the index given a direct mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty
1 answer:
Answer:
a. 1 word
b. 2 words
Explanation:
We say that a computer has a 32-bit memory address when it allows 32-bit memory addresses. This entails that a byte-addressable 32-bit computer can address 232 = 4,294,967,296 bytes of memory, or 4 gibibytes (GiB). This allows one memory address to be efficiently stored in one word.
See attachment for the analysis on a table.
You might be interested in