W5 L5 Completely Fair Scheduling

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

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

  • @elendilion
    @elendilion 7 ปีที่แล้ว +18

    Learned more in 15 minutes than in two weeks of school.

    • @shadow5870
      @shadow5870 7 ปีที่แล้ว +1

      Same here man #FuckSchool xD

    • @mohitsinha1994
      @mohitsinha1994 4 ปีที่แล้ว +1

      @@shadow5870 this lecture video too happened in a school.

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

      lol@@mohitsinha1994

  • @elizabeth2040
    @elizabeth2040 7 ปีที่แล้ว +3

    Great lecture, thank you for sharing!

  • @NB-fx9xe
    @NB-fx9xe 8 ปีที่แล้ว +1

    Excellent Video.

  • @imveryhungry112
    @imveryhungry112 6 ปีที่แล้ว +2

    Thank you Sir. Brilliant explanation.

  • @RaushanKumar-rd7we
    @RaushanKumar-rd7we 8 ปีที่แล้ว +1

    THANX A LOT
    GREAT WORK

  • @vikramkota
    @vikramkota 7 ปีที่แล้ว

    Is there a timeslice associated with a left most process in CFS? OR will it execute until it finishes?

  • @vireshkumar2766
    @vireshkumar2766 7 ปีที่แล้ว +2

    Looks like a minor correction is required here. Weight of a process is inversely proportional to its nice value. The nicer the process (+20) the lesser its weight and lower its priority. The equation should be vruntime += t / weight. The higher priority process will have a lower nice value and so a higher weight and so its vruntime will increase by a small proportion and so its time runs slower. Nice presentations otherwise. Can have a look at this one as well, its from the Maintainer of the scheduler: th-cam.com/video/ifGbigHM6bM/w-d-xo.html

    • @prithvivelicheti287
      @prithvivelicheti287 7 หลายเดือนก่อน

      looks like just a convention for the weight.