2009/4/23 Robert Watson <rwat...@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? _______________________________________________ svn-src-all@freebsd.org mailing list http://lists.freebsd.org/mailman/listinfo/svn-src-all To unsubscribe, send any mail to "svn-src-all-unsubscr...@freebsd.org"
