Lecture 5/9:Caches-Associative

Поделиться
HTML-код
  • Опубликовано: 29 ноя 2024

Комментарии • 12

  • @RhoPGC
    @RhoPGC 4 года назад +16

    Harry Porter and the Fully Associative Cache

  • @jimmydarkful
    @jimmydarkful 4 года назад

    Bravissimo. L'unico video su RUclips che ha spiegato in maniera DECENTE questa cosa.

  • @Sid-ge9vb
    @Sid-ge9vb 5 лет назад

    I really appreciate what you are doing

  • @khellafkhaled6631
    @khellafkhaled6631 8 лет назад +2

    you're a legend...thanks lot

  • @andrewcekuta8627
    @andrewcekuta8627 4 года назад

    good videos!

  • @andrewlarkins133
    @andrewlarkins133 5 лет назад

    Thank you, sir.

  • @malehakim248
    @malehakim248 6 лет назад

    But 2^16 = 65,536, Why do we say the maximum addressable addresses are 64,000? I assumed if we had a word, which contains 4bytes. If i divide 64,000 by 32 bits, somewhere i start getting decimal values. I would assume i get whole number all the way through

    • @vyor8837
      @vyor8837 5 лет назад

      because 65,536 *is* the max.

    • @samuelwallace7036
      @samuelwallace7036 5 лет назад

      You are correct, 6400 is based on an approximation that 2^10 = 1024 which is pretty close to 1000

  • @sebastianlacki8483
    @sebastianlacki8483 7 лет назад

    Just to be clear there are 26 bits in the tag meaning 2^26 combinations of keys correct?

    • @GokulNathXYZ
      @GokulNathXYZ 6 лет назад

      Yes, for every position you will have either 0 or 1. Hence, 2*2*2... = 2^26.

  • @EnxiW
    @EnxiW 6 лет назад

    Thanks a lot !