[lkml]   [2001]   [Jul]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: CPU affinity & IPI latency
On Fri, Jul 13, 2001 at 09:41:44AM -0700, Davide Libenzi wrote:
> I personally think that a standard scheduler/cpu is the way to go for SMP.
> I saw the one IBM guys did and I think that the wrong catch there is trying
> always to grab the best task to run over all CPUs.

That was me/us. Most of the reason for making 'global scheduling'
decisions was an attempt to maintain the same behavior as the existing
scheduler. We are trying to see how well we can make this scheduler
scale, while maintaining this global behavior. Thought is that if
there was ever any hope of someone adopting this scheduler, they would
be more likely to do so if it attempted to maintain existing behavior.

> I think that this concept could be relaxed introducing less chains between each
> CPU scheduler.
> A cheap load balancer should run, "time to time"(tm), to move tasks when a
> certain level of unbalancing has been reached.
> This will give each scheduler more independence and will make it more scalable,

Take a look at the 'CPU pooling & Load balancing' extensions to our
scheduler( It allows you to divide
the system into CPU pools keep scheduling decisions limited to
these pools. Periodicly, load balancing will be performed among
the pools. This has shown some promise on NUMA architectures (as
one would expect). You could define pool sizes to be 1 CPU and
get the scheduling behavior you desire on SMP.

But, none of this has to do with CPU affinity issues with the
current scheduler.

Mike Kravetz
IBM Linux Technology Center
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: 2005-03-22 12:57    [W:0.068 / U:1.436 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site