Lecture 17. Memory Hierarchy and Caches - Carnegie Mellon - Comp. Arch. 2015 - Onur Mutlu

Поділитися
Вставка
  • Опубліковано 5 січ 2025

КОМЕНТАРІ • 10

  • @JonMasters
    @JonMasters 9 років тому +7

    I love the questions you optimistically ask, such as "have any of you programmed with overlays?". This is how I know I am "old" compared to the bright young minds of tomorrow.

  • @JonMasters
    @JonMasters 9 років тому +9

    It's also good to come back and watch lectures (not just papers like information theory). There's a lot one can refresh from prof. Mutlu. I know I tell my colleagues to check out this course when they ask me questions that are covered here.

  • @adeshshetty2830
    @adeshshetty2830 7 років тому +4

    Memory Hierarchy starts at: ua-cam.com/video/AXf_C5qOm8o/v-deo.html
    Cache basics starts at: ua-cam.com/video/AXf_C5qOm8o/v-deo.html

  • @lagaleradelconejo5005
    @lagaleradelconejo5005 4 роки тому +5

    7:43 arranca la clase
    26:44 arranca la parte de memoria que entra en el final
    45:45 la parte que de verdad entra en el final, en los minutos anteriores explica cómo funciona físicamente una memoria, me siento estafado por cubawiki y su sugerencia de videos
    Ver el video en x1.25

  • @anex16
    @anex16 2 роки тому

    Is there a video of the talk the professor is referring to at 3:44 related to cache miss demonstration?

  • @blakef.8566
    @blakef.8566 4 роки тому

    58:53 I am having trouble seeing how the 2 equations for T_i are equivalent. Can anyone help me out?

    • @aidandougherty7012
      @aidandougherty7012 4 роки тому +2

      He's leveraging the fact that the miss rate plus hit rate is 1, or h + m = 1. To make it look easier, consider each letter below subscripted with "i" and the big T as "T_{i+1}"
      1) ht + m(t + T)
      2) ht + mt + mT
      3) t(h+m) + mT
      4) t(1) + mT