Why do the CFS chase fairness?
mobile.parmenides at gmail.com
Tue Sep 20 12:46:46 EDT 2011
2011/9/21 Mulyadi Santosa <mulyadi.santosa at gmail.com>:
> Hi Permenides :)
> Looks like I made few typos here and there, so allow me to put few erratas :)
>> 2011/9/20 Mulyadi Santosa <mulyadi.santosa at gmail.com>:
>>> What the scheduler needs perhaps at this point is good priority
>>> recalculation is C could run ASAP. If not, even though C is in run
> "recalculation so C could be executed ASAP. ......."
>>> queue, it still can beat the other processes in the competition of CPU
> "...it could be beaten by other processes.."
Yes, even with enough timeslice, if C does not have high enough
priority, it can not preempt A or B. That's the point where priority
play its role when the scheduler prefer to IO-bound tasks. Thank you
More information about the Kernelnewbies