Question

Question 10 (10 points) Consider a cache of 8 lines of 16 bytes each. Main memory...

Question 10 (10 points)

Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks of 16 bytes each. That is, block 0 has bytes with addresses 0 through 15, and so on. Now consider a program that accesses memory in the following sequence of addresses:

  • Loop three times: 10 through 20; 32 through 52.
  • Once: 20 through 35.

Suppose the cache is organized as direct mapped. Memory blocks 0, 8, 16 and so on are assigned to line 1; blocks 1, 9, and so on to line 2; and so on. Compute the hit ratio during this process. Provide details regarding how you get the answer.

Question 11 (10 points)

Given a 8-bit word 00111001, suppose when the word is read from memory, the new check bits are calculated based on the fetched reading is 0001. Provide details regarding how you get the answer.

  1. Is the data fetched correctly? (6 points)
  2. If no, is the data bit or check bit goes wrong?( 3 points)
  3. What is the additional checking bit that you need to store in the memory if you want to use it to detect two bits error? (1 point)
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Q10.

Block size => 16 Bytes -> Block offset = log 16 = 4 bits. Lets see how address is stored in main memory block. Address Range

Please don't post so many questions at once. I have solved how much I have been asked to.

If you have any questions comment down and please? upvote thanks

Add a comment
Know the answer?
Add Answer to:
Question 10 (10 points) Consider a cache of 8 lines of 16 bytes each. Main memory...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks...

    Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks of 16 bytes each. That is, block 0 has bytes with addresses 0 through 15, and so on. Now consider a program that accesses memory in the following sequence of addresses: Loop three times: 10 through 20; 32 through 52. Once: 20 through 35. Suppose the cache is organized as direct mapped. Memory blocks 0, 8, 16 and so on are assigned to line...

  • Given a 8-bit word 00111001, suppose when the word is read from memory, the new check...

    Given a 8-bit word 00111001, suppose when the word is read from memory, the new check bits are calculated based on the fetched reading is 0001. Provide details regarding how you get the answer. Part 1) Is the data fetched correctly? Part 2) If no, is the data bit or check bit goes wrong? Part 3) What is the additional checking bit that you need to store in the memory if you want to use it to detect two bits...

  • 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,...

  • 2. A computer uses a memory with addresses of 8 bits. (What's the size of the...

    2. A computer uses a memory with addresses of 8 bits. (What's the size of the MM?) This computer has a 16-byte cache with 4 bytes per block. (How many blocks in the cache?) The computer accesses a number of memory locations throughout the course of running a program. Suppose this computer uses direct-mapped cache. a. What's the format of a memory address as seen by the cache ? Tag ? bits Block ? bits Offset ? bits b. The...

  • 3. (12 points) Consider a cache has lines of 16 bytes and a total size of...

    3. (12 points) Consider a cache has lines of 16 bytes and a total size of 16 kB. The main memory is 16MB and a word takes 4 bytes. For the hexadecimal main memory addresses FFF666, show the following information in hexadecimal format a. Tag and word values for associative cache b. Tag, set and word values for a two-way set-associative cache 3. (12 points) Consider a cache has lines of 16 bytes and a total size of 16 kB....

  • Assume the cache can hold 64 kB. Data are transferred between main memory and the cache...

    Assume the cache can hold 64 kB. Data are transferred between main memory and the cache in blocks of 4 bytes each. This means that the cache is organized as 16K=2^14 lines of 4 bytes each. The main memory consists of 16 MB, with each byte directly addressable by a 24-bit address (2^24 =16M). Thus, for mapping purposes, we can consider main memory to consist of 4M blocks of 4 bytes each. Please show illustrations too for all work. Part...

  • 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 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...

  • 32 bytes of memory. 16 bytes of 2-way setassociative cache, where blocks can go anywhere within...

    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...

  • 32 bytes of memory. 16 bytes of 2-way set-associative cache, where blocks can go anywhere within...

    32 bytes of memory. 16 bytes of 2-way set-associative cache, where blocks can go anywhere within the set. Block is 2 bytes, set in cache is two blocks. Populate memory starting with upper-case letters, then 0-5. 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.
1) Break down the addressing: Tag...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT