[lkml]   [2007]   [Jul]   [25]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [RFC] scheduler: improve SMP fairness in CFS

* Li, Tong N <> wrote:

> The problem I see is that the current load balancing code is quite
> hueristic and can be quite inaccurate sometimes. Its goal is to
> maintain roughly equal load on each core, where load is defined to be
> the sum of the weights of all tasks on a core. If all tasks have the
> same weight, this is a simple problem. If different weights exist,
> this is an NP-hard problem and our current hueristic can perform badly
> under various workloads. A simple example, if we have four tasks on
> two cores and they have weights 1, 5, 7, 7. The balanced partition
> would have 1 and 7 on core 1 and 5 and 7 on core 2. But you can see
> the load isn't evenly distributed; in fact, it's not possible to
> evenly distribute the load in this case. Thus, my opinion is that only
> balancing the load as we do now is not enough to achieve SMP fairness.
> My patch was intended to address this problem.

could you please try my patch nevertheless and see how much it differs
in practice from your solution, and cite specific examples and
measurements? (please measure over longer periods of time such as 120
seconds or 300 seconds - so that slow-rate balancing has its chance to

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2007-07-25 21:21    [W:0.089 / U:5.840 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site