HomeworkLib
Question

An address of a set associative cache memory has this arrangement: 1. Tag 2. Set 3....

An address of a set associative cache memory has this arrangement:
1. Tag 2. Set 3. Word
With the tag using the most significant bits.
What difference does it make if we swap the position of the word with the tag, as seen below:
1. Word 2. Set 3. Tag

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

_________________________________________________________________________________________

If you any query please feel free to ask in comments, I will be happy to help you. Thank you...

0 0
Add a comment
Know the answer?
Add Answer to:
An address of a set associative cache memory has this arrangement: 1. Tag 2. Set 3....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

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 a computer using set associative cache has 216 words of main memory and a cache...

    Suppose a computer using set associative cache has 216 words of main memory and a cache of 32 blocks, and each cache block contains 8 words. 3. If this cache is 2-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and word fields? If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?...

  • Suppose a computer using fully-associative cache has 222 words of main memory and a cache of...

    Suppose a computer using fully-associative cache has 222 words of main memory and a cache of 32 blocks, where each cache block contains 16 bytes. How many blocks of main memory are there? Assuming memory addressing starts from zero, what is the highest memory address? How many bits are needed to represent all of the memory addresses? What is the format of a memory address as seen by the cache, that is, what are the sizes of the tag and...

  • Suppose a computer has 216 words of main memory, and a cache of 64 blocks, where...

    Suppose a computer has 216 words of main memory, and a cache of 64 blocks, where each cache block contains 32 words. Please explain step by step. a) If this cache is a direct-mapped cache, what is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and word fields? b) To which cache block will the memory reference F8C9 map?   c) If this cache is fully associative, what is the...

  • A 2-way set associative cache consists of four sets 0, 1, 2, 3. The main memory...

    A 2-way set associative cache consists of four sets 0, 1, 2, 3. The main memory is word addressable (i.e. treat the memory as an array of words indexed by the address). It contains 2048 blocks 0 through 2047, and each block has eight words. (a) How many bits are needed to address the main memory? (b) Show how a main memory address will be translated into a tag, a set number, and an offset within a block. Illustrate this...

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

  • Set-Associative Cache. Memory is byte addressable. Fill in the missing fields based upon the properties of a set-associative cache. Click on "Select" to access the list of possible answer...

    Set-Associative Cache. Memory is byte addressable. Fill in the missing fields based upon the properties of a set-associative cache. Click on "Select" to access the list of possible answers. Set Block Size Number of Tag Bits Select] Select] Main Memory Size Cache Size 256 B 1) 128 KiB 16 KiB 2) 32 GiB 32 KiB 1 KiB 3) [Select ] 512 KiB 1 KiB [Select ] 10 16 GiB 4 KiB Select ] I Select ] 5) 10 64 MiB...

  • Cache Layout: A processor has a separate D-cache and an I-cache. D-cache: 64KB, 4-way set associative,...

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

  • Please refer the following memory system : Main memory : 64 MB Cache memory: 64 KB...

    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?

  • 1. 2-way Set Associative Cache Memory Consider a hypothetical machine with 1K words of cache memory....

    1. 2-way Set Associative Cache Memory Consider a hypothetical machine with 1K words of cache memory. They are in two-way set associative organization, with cache block size of 128 words, using LRU replacement algorithm. Suppose the cache hit time is 9ns, the time to transfer the first word from main memory to cache is 50ns, while subsequent words require 10ns/word. Consider the following read pattern (in blocks of 128 words, and block id starts from 0): 1 2 3 5...

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

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