#23 Completely Fair Scheduling | Introduction to Operating Systems

[@elendilion]

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

[@shadow5870]

Same here man #FuckSchool xD

[@mohitsinha1994]

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

[@matthewerwine8333]

lol@@mohitsinha1994

[@elizabeth2040]

Great lecture, thank you for sharing!

[@imveryhungry112]

Thank you Sir. Brilliant explanation.

[@NB-fx9xe]

Excellent Video.

[@RaushanKumar-rd7we]

THANX A LOT GREAT WORK

[@vikramkota]

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

[@vireshkumar2766]

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: kzbin.info/www/bejne/n5eqk5ydfbJpmK8

[@prithvivelicheti287]

looks like just a convention for the weight.