Date: Fri, 03 Jun 2005 09:36:07 +0200 From: David Landgren <david@landgren.net> To: David King <ketralnis@ketralnis.dyndns.org> Cc: freebsd-smp@freebsd.org Subject: Re: Assignmet of CPUs Message-ID: <42A00867.7020505@landgren.net> In-Reply-To: <845448d08ea438ecc1d735af8eaf5f6f@ketralnis.dyndns.org> References: <429E67CB.6090901@pacific.net.sg> <6845d25a0506020616293991e3@mail.gmail.com> <429F759F.1000403@landgren.net> <845448d08ea438ecc1d735af8eaf5f6f@ketralnis.dyndns.org>
next in thread | previous in thread | raw e-mail | index | archive | help
David King wrote:
>> Well, round-robin startup would at least be better than always using
>> one process to start all processes. That would go some of the way
^^^^^^^
I did of course mean to say processor here.
David
>> towards improving asymmetric heating. (Says me, whose knowledge of
>> kernel scheduling could be written on the face of a chip and still
>> leave room for footnotes...)
>
>
> In the spirit of small amounts of scheduling knowledge, are load
> averages kept on individual processors? Or can they be determined fast
> enough to not increase the process creation time significantly (or at
> least to be offset by the speed gained), in order to put a process or
> thread on the least encumbered processor? top(1) lists the assigned CPU,
> so it seems like it would be simple enough to determine on-the-fly, but
> if it's not kept somewhere, I wouldn't want to iterate every process to
> get its assigned CPU every time I create a new one.
>
> Is there a "scheduling-for-dummies" feasibly (even if not easily) read
> by non-kernel hackers? :)
>
>> David
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?42A00867.7020505>