Memory Hierarchy Q.40

0. Consider a direct mapped cache of size 32 KB with block size 32 bytes. The CPU generates 32 bit addresses. The number of bits needed for cache indexing and the number of tag bits are respectively

  • Option : A
  • Explanation : Here, we have 32 bit virtual address space.
    32 kB cache memory hence, we need 15 bit for occuring them (not all for indexing explained next). So 17 used for tag.
    But here cache are in block of 32 bytes. So, there actually 1 K (blocks) for a indexing 1 K location, we need 10 bits.
    Remainder five are used for selecting byte
    memory-hierarchy
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *