Why do processes with higher priority to be allocated more timeslice?
mulyadi.santosa at gmail.com
Tue Sep 27 11:44:55 EDT 2011
On Tue, Sep 27, 2011 at 20:06, Parmenides <mobile.parmenides at gmail.com> wrote:
> Initially, I think that the scheduler should enlarge the timeslices of
> CPU-bound processes to improve throughput.
>But, now I have realized
> that the two goals of schedulers, namely shorter latency and higher
> throughput, can not be achieved at the same time. Linux scheduler may
> prefer to the former. Thanks! :-)
I always think that the problem is, let N is the number of the jobs,
and M is the number of processor, whenever N>M, scheduler could never
achieve ideal situation (both lower latency and higher throughput). If
at least N=M, now that's we're talkin' :)
Another problem is actually Linux kernel is not real time kernel. It's
not really a big problem actually in most cases, but in some cases it
might e.g sound processing. Unbounded latency in non real time kernel
is a big no no in such situations.
Just my 2 cents thought :)
Freelance Linux trainer and consultant
More information about the Kernelnewbies