2 1 3 Dynamic Scheduling Using Tomasulo's Algorithm

Поділитися
Вставка
  • Опубліковано 24 гру 2024

КОМЕНТАРІ • 26

  • @dimitrisdimos5705
    @dimitrisdimos5705 3 роки тому +22

    No better Tomasulo explanation *in the universe* than in this video. Thank you!

  • @falkmuller232
    @falkmuller232 4 роки тому +9

    I recommend watching the example first. After that I acutally got wtf he was talking about. Great explanation thanks a lot!

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

    Thank you so much for that explanation ! Probably the best video I've seen on the topic

  • @shararmahmood380
    @shararmahmood380 3 роки тому +6

    Really grateful for the lecture series. So clear and concise. Only one technical glitch although insignificant at 13:18 the answer should be 0.34 or an easier solution is updating the second operand to 0.5 instead of 0.2

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

      Yeah lmao i thought he was tripping

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

    This video is the best thing that happened to me today.

  • @reventon_4442
    @reventon_4442 5 років тому +6

    Much appreciated, thank you!

  • @danielvyenielo3735
    @danielvyenielo3735 3 роки тому +2

    Outstanding explanation. Thank you!

  • @enchantedchim9489
    @enchantedchim9489 5 років тому +8

    Extremely helpful, thank you!

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

    Great explanation!
    Thank you so much!

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

    Awesome explanation! Thanks a lot, I will share this video!

  • @arya5644
    @arya5644 3 роки тому +1

    Thank you so much for this explanation! It was so easy to understand when you taught it.

  • @AbhishekSingh-og7kf
    @AbhishekSingh-og7kf 4 роки тому +1

    Great explanation, Thank you so much

  • @fedefede843
    @fedefede843 5 років тому

    Short and very effective. Well done!

  • @sarpe7324
    @sarpe7324 4 роки тому +1

    Great lecture thanks!

  • @sabahatfaria168
    @sabahatfaria168 5 років тому

    Extremely helpful👍👍

  • @adarshpatel6695
    @adarshpatel6695 5 років тому

    Simply great :)

  • @nicolaspassaglia2388
    @nicolaspassaglia2388 5 років тому

    Professor, great videos! I just have one question, why in 0:56, A1 of sub.d cannot start in A2 of add.d if there are no data dependece, isnt the point of using pipelined FP Addition is to allow that? Thanks!

    • @thedrunkensquirell
      @thedrunkensquirell 5 років тому +2

      I believe it is because in his example, there is only one FP adder. So when add.d is calculating 'A1->A4', sub.d cannot be using the same adder as there is no room, thus it must wait.

    • @IStMl
      @IStMl 4 роки тому

      Bc of ressource contention (only 1 FPALU)

  • @gangannagarirashmi
    @gangannagarirashmi Рік тому

    12.55 kaha sey aya

  • @thomasgeorgiadis3062
    @thomasgeorgiadis3062 3 роки тому +1

    Παμε να περασουμε τα μικρο1 αντε!

  • @kamaleshkhanna4735
    @kamaleshkhanna4735 5 років тому +1

    Dankeschön

  • @ahmedrezik147
    @ahmedrezik147 4 роки тому +1

    Extremely helpful, thank you!