Question

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-ma
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Ans for question 1(a,b,c,d)

Giuen Cache Sze Guwrds,eath wrd Phye ca add si3e = sale avaichaty 32 bit a) Dreat th Mapped Carhe no.of lodks t 6lotk 64 (6 c

Nvot 1sh neded tor blit edtut (wi) forc ok-b Phastrol HS 32-6 32-S 32-4 32-4 7 No.of Scts n Cache o mdireltmapped Cache a Set

Ans for question 2

22 iven Eaffes af adrenen era hesfna ao ,20, a, 16, 1 dr cashe - leand cadlress blace blotk offea Hotk nomber Hott aft 20:000

Ans for question 3

For Cashe & blotks uets addren 17 blorka 30 22bi o000000 c0ocoO00 60000000 Cache b Adoutg no K3 3 C-3-sat 3 0-set o Set -2 Se

Add a comment
Know the answer?
Add Answer to:
1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit...
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
  • Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming...

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

  • Cache of 4096 blocks, a 4-word block size, and a 32-bit address, find the total number...

    Cache of 4096 blocks, a 4-word block size, and a 32-bit address, find the total number of sets and the total number of tag bits for caches that are direct mapped, four-way set associative, and fully associative.

  • Assume a cache with 2048 blocks, a 4-word block size, and a 32-bit address. For each...

    Assume a cache with 2048 blocks, a 4-word block size, and a 32-bit address. For each of the following configurations, find the total number of bits for each cache block and the total numbers of bits for the entire cache. a. Direct-mapped b. Two-way set associative c. Four-way set associative d. Fully-associative

  • Using the sequences of 32-bit memory read references, given as word addresses in the following table:...

    Using the sequences of 32-bit memory read references, given as word addresses in the following table: 6 214 175 214 6 84 65 174 64 105 85 215 For each of these read accesses, identify the binary address, the tag, the index, and whether it experiences a hit or a miss, for each of the following cache configurations. Assume the cache is initially empty. A direct-mapped cache with 16 one-word blocks. A direct-mapped cache with two-word blocks and a total...

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

  • ) Consider an 8-way associative 64 Kilo Byte cache with 32 byte cache lines. Assume memory...

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

  • Computer architecture How many SRAM bits are needed to implement an 8KB two-way set associative cache...

    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.

  • Text: Explain how a 32-bit byte memory address should be divided into Tag/Index/Offset fields for each...

    Text: Explain how a 32-bit byte memory address should be divided into Tag/Index/Offset fields for each of the cache configurations below. Note: 1KB = 210 bytes. You must explain how many bits to assign to each field and the ordering of the three fields. You get at most 50% of the credit if you give the length of each field without an explanation. 1) A fully associative cache with cache block size = 2 words and cache size = 512KB....

  • Consider a 32 KiB (not KB) cache in a system where the processor uses 64-bit words....

    Consider a 32 KiB (not KB) cache in a system where the processor uses 64-bit words. The system use the byte address of 36-bits. Each cache line (block) stores 256 bits. a) How many bits are used as the byte offset (b)? How many bits are used as the block offset (m)? b) How many index bits are used? How many blocks (lines) are available in the cache? c) Consider the cache being organized as direct-mapped cache. How many bits...

  • A 64-bit word computer employs a 128KB cache. The address bus in this system is 32-bits....

    A 64-bit word computer employs a 128KB cache. The address bus in this system is 32-bits. Determine the number of bits in each field of the memory address register (MAR) as seen by cache in the following organizations (show your calculations):  a. Fully associative mapping with line size of 1 word. b. Fully associative mapping with line size of 4 words c. Direct mapping with the line size of 1 word. d. Direct mapping with the line size of 8...

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