1. 26 8月, 2007 1 次提交
    • P
      sched: adaptive scheduler granularity · 21805085
      Peter Zijlstra 提交于
      Instead of specifying the preemption granularity, specify the wanted
      latency. By fixing the granlarity to a constany the wakeup latency
      it a function of the number of running tasks on the rq.
      
      Invert this relation.
      
      sysctl_sched_granularity becomes a minimum for the dynamic granularity
      computed from the new sysctl_sched_latency.
      
      Then use this latency to do more intelligent granularity decisions: if
      there are fewer tasks running then we can schedule coarser. This helps
      performance while still always keeping the latency target.
      Signed-off-by: NPeter Zijlstra <a.p.zijlstra@chello.nl>
      Signed-off-by: NIngo Molnar <mingo@elte.hu>
      21805085
  2. 25 8月, 2007 6 次提交
  3. 13 8月, 2007 1 次提交
    • I
      sched: fix sleeper bonus · 5d2b3d36
      Ingo Molnar 提交于
      Peter Ziljstra noticed that the sleeper bonus deduction code
      was not properly rate-limited: a task that scheduled more
      frequently would get a disproportionately large deduction.
      So limit the deduction to delta_exec.
      Signed-off-by: NIngo Molnar <mingo@elte.hu>
      5d2b3d36
  4. 11 8月, 2007 1 次提交
  5. 09 8月, 2007 31 次提交