Lecture 29. Cache Coherence - Carnegie Mellon - Computer Architecture 2015 - Onur Mutlu

แชร์
ฝัง
  • เผยแพร่เมื่อ 31 ธ.ค. 2024

ความคิดเห็น • 7

  • @edulgl
    @edulgl 5 ปีที่แล้ว +18

    0:00 - Review Directory-Based Cache Coherence
    7:23 - Example Directory-Based Cache Coherence
    18:53 - Snooping Cache Coherence
    25:27 - MSI State Machine
    27:11 - MESI State Machine
    47:00 - Revisiting Two Cache Coherence Models
    56:33 - Revisiting Directory-Based Cache Coherence
    1:04:00 - MESI Directory Transaction
    1:11:02 - Scaling the Directory

  • @companymen42
    @companymen42 6 ปีที่แล้ว +7

    Free college yo! Thank you Professor for posting this.

  • @lagaleradelconejo5005
    @lagaleradelconejo5005 4 ปีที่แล้ว +3

    21:00 Arranca MSI y después sigue a MESI

  • @layoww
    @layoww 8 ปีที่แล้ว

    how does token distribution guarantee fairness?

    • @agsystems8220
      @agsystems8220 ปีที่แล้ว

      In case you are still interested, it doesn't, but it isn't actually an algorithm yet. It is a tool within an algorithm that guarantees coherence, no matter how you decide to handle the tokens themselves. That guarantee then lets you build an arbitrarily complicated algorithm with whatever goals you want (such as fairness), without having to prove it is going to work.