Solution
a)Determine number of lines in cache
in the questions, given
2 MB cache
1 KB per cache line
for easy calculation we will convert into 2 power
please note that
1 MB= 2 20
1 KB= 2 10
Number of lines in cache
=cache/line
cache=2 MB= 2* 2 20
line= 1 KB= 2 10
=2* 2 20/2 10
=2 21/2 10
=2 11
=2048
--
b) Determine the number of address bits out of the processor
Number of bits required to address all bytes in the largest memory given as per the question is
=256 MB
=256 * 2 20
=2 8 * 2 20
= 2 28
so 28 bits is the answer
--
c) Determine the number of bits needed for the block offset section of the address
Number of bits needed for the block offset section of the address
=size of the cache line
=1 KB
= 2 10
=10 bits
--
answered first 3 question, really sorry for that
please post remaining question separately, love to answer
all the best
7. In a cache system we have the following attributes: 4 GB of DRAM 256 MB...
Please refer the following memory system : Main memory : 64 MB Cache memory: 64 KB Block size of 1 KB 1. Direct Mapping Offset bits? Number of lines in cache? Line number bits? Tag size? 2. Fully Associative Mapping Offset bits? Tag size? 3. 2-way set-associative mapping Offset bits? Number of lines in cache? Set number bits? Tag size? 4. 4-way set-associative mapping Offset bits? Number of lines in cache? Set number bits? Tag size?
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...
Problem 6. Suppose we have a computer with 32 megabytes of main memory, 256 bytes of cache, and a block size of 16 bytes. For each configuration below, determine the memory address format, indicating the number of bits needed for each appropriate field (i.e. tag, block, set, offset). Show any relevant calculations. Direct cache mapping and memory is byte-addressable a) Direct cache mapping and memory is word-addressable with a word size of 16 bits b) c) 2-way set associative cache...
please solve e & f for this question.
1. (40 points) The Corei7-6700K microprocessor has 3 cache levels about the L2 cache per core and the main memory: (more detailed information can be found at: http://www.cpu-world.com/CPUs/Core i7/Intel-Core%2017-6700.html The following is the information Memory is byte addressable Maximum memory capacity is 64 GB (G=230). Cache capacity is 256 KB (K=210) 4-way set associative is used - Block offset size is 6 bits. If CPU has generated the physical address (411234)10, what...
Cache Layout: A processor has a separate D-cache and an I-cache. D-cache: 64KB, 4-way set associative, block size of 1 word, write-back policy I-cache: 32KB, direct mapped cache, block size of 1 word The processor uses the LRU algorithm for its replacement policy. Answer the following questions. Make sure that you account for all the book -keeping bits. A word is 4 bytes (a) Calculate the number of tag, index and offset bits for the D-cache. (b) Calculate the number...
A primary memory system consists of 128 address bits. Each block within the cache is 256 bytes. The total cache size is 131,072 bytes. What are the sizes of the tag and index in the cache? First, find the number of blocks. 128,000 bytes # Blocks = 256 bytes per block bort = 512 blocks Where does the 128,000 come from?? Now find the number of bits required to distinguish all the blocks. This is the index aka set size....
) 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...
Given a 32-bit address, calculate the following values for a two-way set associative for: Cache size: 32KB Block size: 64B i) The number of bits in the block offset field. ii) The number of index bits. iii) The number of sets in the cache. iv) The number of tag bits.
32 bytes of memory. 16 bytes of 2-way setassociative cache, where blocks can go anywhere within the set. Block is 4 bytes, set in cache is two blocks. Populate memory starting with 0-9, then upper case letters. Hint- with full associativity in the set: each block has its own set of Tag bits in the cache. Memory is not organized by sets, though blocks get assigned to sets, and load in the cache per set. A) Complete: Bits in Address...
a) Suppose we have a 64 KB, direct-mapped cache with 8-word blocks. Determine how many bits are required for the tag, index, and offset fields for a 32-bit memory address. b) If instead, we use a 64 KB, 4-way set-associative cache with 8-word blocks, how many bits will be required for the tag, index, and offset fields for a 32-bit address? c) What type of cache is shown in problem 2? How many bits are required for this cache’s tag,...