svn commit: r191405 - in head/sys: amd64/amd64 i386/i386

Ivan Voras ivoras at freebsd.org
Thu Apr 23 12:01:57 UTC 2009


2009/4/23 Robert Watson <rwatson at freebsd.org>:

> Do you have any ideas about ways to usefully represent and manage concepts
> like "pick a close CPU" or "the set of CPUs that are close"?  For example,
> if I have available a flow identifier, hashing to one of a set of available
> CPUs is easy, but what would you suggest as an efficient representation to
> hash from a set of close available CPUs rather than the entire pool?

Excuse me if I'm missing the point but isn't this already done by ULE
and for almost the same reasons? Shouldn't the scheduler (or its
topology infrastructure if it's separated from the scheduler) be the
best place to do it?


More information about the svn-src-head mailing list