Hi :) On Tue, Sep 27, 2011 at 20:06, Parmenides <mobile.parmenides@xxxxxxxxx> wrote: > Initially, I think that the scheduler should enlarge the timeslices of > CPU-bound processes to improve throughput. True.... :) >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 :) -- regards, Mulyadi Santosa Freelance Linux trainer and consultant blog: the-hydra.blogspot.com training: mulyaditraining.blogspot.com _______________________________________________ Kernelnewbies mailing list Kernelnewbies@xxxxxxxxxxxxxxxxx http://lists.kernelnewbies.org/mailman/listinfo/kernelnewbies
