the following address is requested from a cache: 0x12AC using a direct mapped cache with 32...

Question

Question

the following address is requested from a cache: 0x12AC

using a direct mapped cache with 32 rows and a block size of 8 words, what is the row? What is the tag?

after this, a new address is requested from the cache: 0x12AD

is this a hit or miss? also, if this was a write operation, what other considerations would there be?

Answer 1

Answer #1

Solution:

0x12AC is requested hence he main memory size is 2¹⁶ or it can be represented by 16 bits

total memory size is 32 bits, and according to question 32 rows, hence 5 bits are needed for block and 3 bits for words.

Tag size = 16 - 5 - 3 = 8 bits

Row is the number of block and it is 32 rows and 5 bits are needed to show it.

Tag = 8 bits

Now 0x12AC is requested, it is miss

and then 0x 12AD is requested, it also misses as, i is no available in the cache.

If there is write operations, as is miss, hence is needed to write into the cache. There are two policies to write into cache

1. Write back: Using the write-through policy, data is written to the cache and the backing store location at the same time.

2. write through: Using the write-through policy, data is written to the cache and the backing store location at the same time.

Answer 2

Similar Homework Help Questions

For a direct-mapped cache with a 32-bit address and 32-bit words, the following address bits are...

For a direct-mapped cache with a 32-bit address and 32-bit words, the following address bits are used to access the cache. TAG INDEX OFFSET 31-15 14-8 7-0 a. What is the cache block size (in words)? [13 points] b. How many blocks does the cache have? [12 points]
Question 33 10 pts For a direct mapped cache of 4 blocks with a cache block...

Question 33 10 pts For a direct mapped cache of 4 blocks with a cache block size of 1 byte, in which cache block will each memory location map to? The order of accesses if given by the operation number. Indicate if each access is a hit or a miss, and what the tag value is for each entry. Assume that the cache is initially empty, and the accesses are in order of appearance. REDRAW AND COMPLETE THE CACHE TABLE...
3- for a direct mapped cache design with a 32 bit address, the following bits of address are used...

Please answer all parts correctly and show your work 3- for a direct mapped cache design with a 32 bit address, the following bits of address are used to access the cache Tag Index Offset 31-10 9-5 4-0 Starting from power on, the following byte addressed cache reference are recorded. Address 0 16 132 232 160 1024 30 140 3100180 2180 d. How many blocks are replaced e. What is the hit ratio f. List final state of the cache,...

For a 16K-byte, direct-mapped cache, suppose the block size is 32 bytes, draw a cache diagram....

For a 16K-byte, direct-mapped cache, suppose the block size is 32 bytes, draw a cache diagram. Indicate the block size, number of blocks, and address field decomposition (block offset, index, and tag bit width) assuming a 32-bit memory address.
Targeted Course Learning Outcomes: CLO 2.1 Question 1: Using the “Direct Mapped Cache”, assume that 4-blocks,...

Targeted Course Learning Outcomes: CLO 2.1 Question 1: Using the “Direct Mapped Cache”, assume that 4-blocks, 1 word/block, direct mapped Initial state is empty as shown below. Index V Tag Data 00 N 01 N 10 N 11 N And the following addresses have been requested in the following sequences: Request 1: Word Addresses 4, 5 and 7 Request 2: Word Addresses 0, 1 and 3 Request 3: Word Addresses 1, 2 and 3 Request 4: Word Addresses 3, 4...
Design a 256KB (note the B) direct‐mapped data cache that uses a 32‐bit address and 8...

Design a 256KB (note the B) direct‐mapped data cache that uses a 32‐bit address and 8 words per block. Calculate the following: How many bits are used for the byte offset and why? How many bits are used for the set (index) field? How many bits are used for the tag? What’s the overhead for that cache?

For a direct-mapped cache design with a 32-bit address, the following bits of the address are...

For a direct-mapped cache design with a 32-bit address, the following bits of the address are used to access the cache. Tag Index Offset 31-10 9-4 3-0 How many entries does the cache have?
Consider a direct-mapped cache with 32 blocks Cache is initially empty, Block size = 16 bytes...

Consider a direct-mapped cache with 32 blocks Cache is initially empty, Block size = 16 bytes The following memory addresses (in hexadecimal) are referenced: 0x2B4, 0x2B8, 0x2BC, 0x3E8, 0x3EC,0x4F0, 0x8F4, 0x8F8, 0x8FC. Map addresses to cache blocks and indicate whether hit or miss
Question 3: Consider a 32-bit physical address memory system with block size 16 bytes and a...

Question 3: Consider a 32-bit physical address memory system with block size 16 bytes and a 32 blocks direct mapped cache. The cache is initially empty. The following decimal memory addresses are referenced 1020, 1006, 1022, 5106, 994, and 2019 Map the addresses to cache blocks and indicate whether hit or miss. Note: You must use the hexadecimal approach in solving this question. You must also show the computations of dividing the memory address into tag bits, cache index bits,...

Using the sequences of 32-bit memory read references, given as word addresses in the following table:...

Using the sequences of 32-bit memory read references, given as word addresses in the following table: 6 214 175 214 6 84 65 174 64 105 85 215 For each of these read accesses, identify the binary address, the tag, the index, and whether it experiences a hit or a miss, for each of the following cache configurations. Assume the cache is initially empty. A direct-mapped cache with 16 one-word blocks. A direct-mapped cache with two-word blocks and a total...