lkml.org 
[lkml]   [2010]   [Sep]   [11]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
Subject[RFC patch 0/2] sched: dynamically adapt granularity with nr_running
Changing the minimum granularity is a double-edged sword: if we set it to a too
small value, then the scheduler will preempt tasks too often. If it is too
large, then the "latency" period can grow very large as the number of running
tasks increases.

The first patch leaves the same scheduling granularity when there are few tasks
on the system (3 or less), but dynamically adapts (shrinks) the sched
granularity when there are more. At a ceiling value of 8 running tasks (this
choice is arbitrary), it grows the latency rather than shrinking granularity
further to ensure we don't end up calling the scheduler too often.

The second patch ensures that awakened sleeping tasks don't get affected by
shrinked minimum granularity.

Comments are welcome,

Thanks,

Mathieu

--
Mathieu Desnoyers
Operating System Efficiency R&D Consultant
EfficiOS Inc.
http://www.efficios.com


\
 
 \ /
  Last update: 2010-09-11 19:43    [W:0.326 / U:0.016 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site