Question

Question 29 7 pts Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 4 bytes each. Assuming that
0 0
Add a comment Improve this question Transcribed image text
Answer #1
  • Given byte addressable system
  • main memory address = 8 bit // 8 bits needed to represent main memory address
  • No of cache Blocks = 8 blocks = 23blocks // 3 bits needed to represent no of cache blocks in cache memory
  • Block size = 4 byte = 22byte                                // 2 bits needed to represent block offset
  • format of a memory address as seen by the Direct Map cache  
  • tag =3 bits cache index = 3 bits offset = 2 bits

<..................................memory address 8 bit..............................................................>

Tag(3 bits) Cache Block index (3 bits) Offset ( 2 bits)

Direct Map cache

hexadecimal memory address 0x1F will map to cache block number 7 // binary (111 )2

                                0x 1 F

0001 1111 // Now separate bits according to direct map format

000 1 11 11

  • tag =000
  • cache index = 111
  • offset = 11

cache block No = (1 11)2 = ( 7 )10

Add a comment
Know the answer?
Add Answer to:
Question 29 7 pts Suppose we have a byte-addressable computer with a cache that holds 8...
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
  • Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 4 bytes...

    Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 4 bytes each. Assuming that each memory address has 8 bits and cache is originally empty, for the cache mapping technique, two-way set associative, trace how cache is used when a program accesses the following series of addresses in order: 0x01, 0x04, 0x09, 0x05, 0x14, 0x21, and 0x01.

  • Question 28 7 pts Consider a byte-addressable computer with 24-bit addresses, a cache capable of storing...

    Question 28 7 pts Consider a byte-addressable computer with 24-bit addresses, a cache capable of storing a total of 64K bytes of data, and blocks of 32 bytes. If the computer uses direct mapping, the format of the memory address is as follows: bits for the tag field, bits for the cache block number, and bits for the block offset.

  • both ques pls Question 26 1 pts Information can be retrieved fastest from: USB flash drive....

    both ques pls Question 26 1 pts Information can be retrieved fastest from: USB flash drive. magnetic tape. optical disk. hard disk. Question 27 7 pts Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 4 bytes each. Assuming that each memory address has 8 bits, to which cache block would the hexadecimal address Ox 17 map if the computer uses direct mapping?

  • please answer $5 UXIF map in the computer uses direct mapping Question 18 5 pts Suppose...

    please answer $5 UXIF map in the computer uses direct mapping Question 18 5 pts Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. Suppose also that each block contains 8 bytes. The size of the block offset field is bits, the bits. size of the set field is bits, and the size of the tag field is 5 pts Question 19 Suppose we have a byte-addressable computer...

  • Suppose a computer using direct mapped cache has 232 byte of byte-addressable main memory, and a...

    Suppose a computer using direct mapped cache has 232 byte of byte-addressable main memory, and a cache of 1024 blocks, where each cache block contains 32 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 0x000063FA map?

  • QUESTION 2 Suppose a computer using direct mapped cache has 216 bytes of byte-addressable main memory...

    QUESTION 2 Suppose a computer using direct mapped cache has 216 bytes of byte-addressable main memory and a cache of 64 blocks, where each cache block contains 32 bytes. a. How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, (include field names and their sizes) c) To which cache block will the memory address (F8C916 map? What address in that block does it map to?

  • Suppose a computer using a fully associative cache has 232 bytes of byte-addressable main memory and...

    Suppose a computer using a fully associative cache has 232 bytes of byte-addressable main memory and a cache of 1024 blocks, were each cache block contains 32 bytes. Consider a memory address as seen by the cache. How many bits are in the tag field?

  • Problem 6. Suppose we have a computer with 32 megabytes of main memory, 256 bytes of...

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

  • 29 pls clesr ans the average access time for the processor to access an item? 29ns...

    29 pls clesr ans the average access time for the processor to access an item? 29ns Question 29 7 pts Consider a byte-addressable computer with 24-bit addresses, a cache capable of storing a total of 64K bytes of data, and blocks of 32 bytes. If the computer uses direct mapping, the format of the memory address is as follows: bits for the tag field, bits for the cache block number, and bits for the block offset. Question 30 7 pts...

  • pls both 31 Question 31 10 pts Suppose we have a byte-addressable computer using 4-way set...

    pls both 31 Question 31 10 pts Suppose we have a byte-addressable computer using 4-way set associative mapping with 24-bit main memory addresses and 64 blocks of cache. Suppose also that a block contains 32 bytes. The size of the block offset field is bits, the size of the set field is bits, and the size of the tag field is bits. Question 32 1 pts is the oldest and most cost-effective of all mass-storage devices. Magnetic tape Compact dick...

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