COMP 620 Homework#2

a Block size has no influence on the number of compulsory misses. True False b Direct mapped caches often use the LRU or Random cache block replacement strategies. True False c Since caches contain actual data, the tag must refer to a physical memory address. True False d Since the patterns of access for instructions and data differ, it is common to providing separate instruction and data caches (often L1). True False e The number of compulsory misses can never be reduced. True False

5. A computer of 32 bits has a cache memory of 64 KB with a cache line size of 64 bytes. The cache access time is 20 ns, and the miss penalty is 120 ns. The cache is 2-way associative. a) What is the number of cache lines? b) What is the number of cache sets? c) What is the number of lines per set? d) Draw a scheme of this cache. e) Calculate the time to read a word in case of miss.

Q: A digital computer has a memory unit of  64k * 16 and a cache memory of 1k words. The cache uses direct mapping with a block size of 4 words. i) How many bits are there in the tag, index, block & words fields of the address formats.ii) How many bits are there in each word of cache? iii) How many blocks can the cache accommodate? Note: this question is related from computer architecture subject kindly solved this correctly and completly.

Suppose a byte-addressable computer using 8-way set associative cache has 256MB of main memory and a cache of 64 blocks, where each cache block contains 32 bytes. a) There are _____ blocks of main memory. b) The sizes of the offset field is bits, c) The size of the tag field is bits. d) The memory address Ox0080AA maps to a cache block in the set#_

Number 2 cse .part 2 ,sir please solve this for me.it will be a great help ,you can solve it in a page

• The entire cache block is read on any miss. • It takes one memory access to read (or write) a block from memory. • Write-allocate is used. • Write-through is used. Use the following table to show the number of memory access for each condition (row) mentioned: Cache hit? Yes Yes Assume the following properties about a cache system: Yes Yes No No No No Access Type Block dirty? Total number of memory accesses Read Read Write Write Read Read Write Write Y N Y N N Y N Y Note: "Block dirty?" is in reference to the "old" block to be replaced with the new block that the cache is attempting to access.

Question 19

It is important to make a distinction between caches that are fully associative and caches that are directly mapped.

3. The series of memory address references given as word addresses are 122, 126, 126, 126, 116, 300, 116, and 118. Assume a direct-mapped cache with eight one-word blocks that is initially empty. Label each reference in the list as a hit or miss and show the contents of the cache with figure after each reference.

Please help me in this question: 16/All of the following are cache replacement algorithms except:        a. LRU b. FIFO c. Random d. Thrashing   Thank you!

tn a Gwey number of nesber of cache block ip 256. Neember of blocky Set associative cache worde werds any equal to block sye tag bite cre four size fuhysicel memory

help with part A B AND C.

2. For a direct-mapped cache with a 32-bit address, the following bits of the address are used to access the cache. Tag 31-10 Hex Dec 0 a) What is the cache block size (in words)? b) How many entries does the cache have? c) What is the ratio between total bits required for such a cache implementation over the data storage bits? Beginning from power on, the following byte-addressed cache references are recorded 00 04 4 Byte Address Index 9-5 Binary Address d) For each reference, list (1) its tag, index, and offset, (2) whether it is a hit or a miss, and (3) which bytes were replaced (if any). e) What is the hit ratio? Address 10 84 E8 АО 400 IE 8C CIC B4 884 16 132 232 160 1024 30 140 3100 180 2180 Offset 4-0 Tag Index Offset Hit/Miss Bytes Replaced

What is the difference between a cache that is entirely associative and a cache that is directly mapped?

Homework 2 Note: This homework is for topics covered in Chapter 2. You do NOT have to submit it. 1. If the number of bits in the memory address is 7 bits, what is the maximum memory size? 2. True or False a. A typical memory hierarchy starts with a small, cheap, and relatively slow module, called the cache () b. A byte has 4 bits () section: 3. Place the following commands in the (POP, ROTATE, RETURN, SHIFT, AND, INCREMENT) proper Data Movement Arithmetic and Sequencing Input/Output Instructions Logical Instructions Instructions Instructions

Q1. For a direct-mapped cache design with a 32-bit address, the following bits of the address are used to access the cache. Tag 31-10 Index 9-5 a) How many words of data in each cache line? b) How many lines does the cache have? c) d) Offset 4-0 What is the cache data size (in bits)? What is the ratio between total bits required for such a cache implementation over the data storage bits?

In designing a computer’s cache system, the cache block or cache line size is an important parameter. Which of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size implies a smaller cache tag and hence lower cache tag overhead A smaller block size implies a larger cache tag and hence lower cache hit time A smaller bock size incurs a lower cache miss penalty

Correct and detailed answer please. I will Upvote. Thank you!

Cache Mapping Technique 1. Suppose a computer usingdirect-mapped cache has 2 bytes of byte=addressable main memory and a cache of32 blocks, where each cache block contains 16 bytes.a) How many blocksof main memory are there?b) What is theformat of a memory address as seen by the cache; that is, what are the sizes ofthe tag, block, and offset fields?c) To which cacheblock will the memory address 0x0DB63 map?2. Suppose a computer using fullyassociative cache has 2 bytes of byte-addressable main memory and a cache of128 blocks, where each cache block contains 64 bytes.a) How many blocksof main memory are there?b) What is theformat of a memory address as seen by the cache; that is, what are the sizes ofthe tag and offset fields?c) To which cacheblock will the memory address 0x01D872 map?3. A 2-way set-associative cacheconsists of four sets. Main memory contains 2K blocks of 8 bytes each and byte addressingis used.a) Show the mainmemory address format that allows us to map addresses from…

11. Show final cache where block size =2, N = 4 Cache Memory 20 21 22 23 24 25 26 27 28 29 30 31 hits = misses = 7 3 27 32 101 78 59 24 56 87 36 98 1 2 3 Address Data hit rate = miss rate = 12 3 4 5 6 7 LO 00 8 9 Read 30 Read 31 Read 30 Read 26 Read 25 Read 28 Read 23 Read 25 Read 28 10 Read 30 11 Read 31 12 Read 30 13 Read 26 14 Read 25 15 Read 28 16 Read 23 17 Read 25 18 Read 28

2

consider someone is using direct-mapped cache memory, each external memory address maps to what?     a specific cache memory location     one of many different cache memory locations     a unique cache memory location, not shared with other external addresses     a randomly-selected cache memory location

Q: A digital computer has a memory unit of 64k * 16 and a cache memory of 1k words. The cache uses direct mapping with a block size of 4 words. i) How many bits are there in the tag, index, block & words fields of the address formats. ii) How many bits are there in each word of cache? iii) How many blocks can the cache accommodate?

Make a distinction between a cache that is entirely associative and a cache that is directly mapped.

1. Suppose a computer using direct mapped cache has 2^20 bytes of byte-addressable main memory, and a cache of 128 blocks, where each cache block contains 64 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag, block, and offset fields? c) To which cache block will the memory address Ox0DAB3 map?

Assume you have a cache/memory system with the following characteristics: Size of a word: 4 bytes Size of a cache block: 4 words Size of cache: 16 words Associativity of the cache: 2-way Set Associative. Replacement Policy: LRU (Least Recently Used) How many sets are present in this cache? Assume that the following word addresses are accessed as read in the following order. In each case, say whether or not the corresponding access is a hit or a miss. If it is a miss, specify what kind of miss it is. Words accessed: 4, 3, 6, 8, 1, 24, 16, 19, 20, 19, 1. What is the miss rate for this cache and this pattern of word accesses? Draw a figure showing the final state of the cache.

.2: Below is a list of 32-bit memory address references, given as word addresses. 3, 180, 43, 2, 191, 88, 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. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 2-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 4-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty.