Computer architecture
How many SRAM bits are needed to implement an 8KB two-way set associative cache with 64B block size? Assume that each line (entry) has a single valid bit and no dirty bits. There is one bit per set for true LRU. Assume that the address size of the machine is 32-bits and that the machine allows for byte addressing.
Solution
Total number of cache blocks
= 8KB/64B
= 128
then we can find the number of sets
Number of sets
= 128/2
= 64
Therefore total bit required to implement Valid bit & true LRU is
=64+128
=192 bits
from, that we can clearly see that 6 bits is needed for selecting the set & another 6 bits needed for selecting the byte in the block making total of 12-bits
the remaining 32-bits is managed for tags that is needed for each block.
Therefore for tag total number of bit is required
=20 x 128 bits
=2560 bits
Then total bit to manage memory
= 8 x1024 x 8
= 65536 bits
It will make total of 68288 bits of SRAM bits
Making total of 68288 bits of SRAM Bits.
---
all the best
Computer architecture How many SRAM bits are needed to implement an 8KB two-way set associative cache...
Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming a 32-bit address, for each of the following organizations, complete the table. a.A direct-mapped cache with block size = 16words b.2-way set-associative cache with block size = 8words c.4-way set-associative cache with block size = 4words d.A fully associative cache with block size = 2words. Cache a Cache b Cache c Cache d total # bits for word & byte displacement # bits in...
1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit address. There are four different caches a. A direct-mapped cache with block size = 16 words b. 2-way set-associative cache with block size = 8 words c. 4-way set-associative cache with block size=4 words d. A fully associative cache with block size = 16 words. Complete the table for each cache. Cache a Cache be Cache Cache de 16 Number of bits needed for...
) Consider an 8-way associative 64 Kilo Byte cache with 32 byte cache lines. Assume memory addresses are 32 bits long. a). Show how a 32-bit address is used to access the cache (show how many bits for Tag, Index and Byte offset). b). Calculate the total number of bits needed for this cache including tag bits, valid bits and data c). Translate the following addresses (in hex) to cache set number, byte number and tag (i) B2FE3053hex (ii) FFFFA04Ehex...
Consider a 4-way set associative cache, with a capacity of 16 KiB and contains 512 cache lines. 32-bit byte addresses are used. What is the actual number of bits needed for this cache, assuming it is write-back? Include the necessary status bits (assume that 2 bits per cache line are required for this cache block replacement algorithm).
Q2. Consider a four-way set associative cache with a data size of 64 KB. The CPU generates a 32-bit byte addressable memory address. Each memory word contains 4 bytes. The block size is 16 bytes. Show the logical partitioning of the memory address into byte offset, cache index, and tag components.
A 256kiB (2^18 bytes) cache has a block size of 32 bytes and is 32-way set-associative. How many bits of a 32-bit address will be in the Tag, Index, and Bock Offset?
You have a 2-way set associative L1 cache that is 8KB, with 4-word cache lines. You get the following sequence of writes to the cache --each is a 32-bit address in hexadecimal 0x32E4 0x8000 0x1F50 0x8004 0x72EC OxDOOC 0x800C 0x72E8 0x4008 OxD000 0x82E0 a) [7 Pts] How many cache misses occur with an LFU (Least Frequently Used) policy? Give a detailed answer and fill in the table below for each address reference Set Index (in hex) Memory address(in hex) 0x32E4...
question 2 and 3 2. Determine how many sets of cache blocks will be there for the following Cache memory size (in bytes) Direct Mapped Blocks Size (in bits) 32 64 218 2-way Set Associative Block Size (in bits) 32 64 A 2A6 [0.5 * 16 = 8] 4-way Set Associative Block Size (in bits) 32 64 SK 64K 256K 3. The physical memory address generated by a CPU is converted into cache memory addressing scheme using the following mapping...
0. (10 Points) A four-core i7 has a 8 MB L3 cache 8-way set associative of block size 32 bytes. It uses 30-bit block address (36-bit physical address, 6-bit block offset). What is the addressing organization of L3? ANSWER Block Address - Block offset Index Tag-