[haiku-development] Re: On timeslices and cycles
- From: Truls Becken <truls.becken@xxxxxxxxx>
- To: haiku-development@xxxxxxxxxxxxx
- Date: Mon, 16 Mar 2009 15:42:36 +0100
Christian Packmann wrote:
> Rene Gollent - 2009-03-16 14:47 :
>>
>> All it takes
>> is a single busy higher priority thread getting scheduled on the same
>> core and your careful tuning has gone out the window, since I
>> guarantee that it will run faster if the scheduler is able to drop it
>> onto an idle core on a different CPU than if it can't run at all, FSB
>> latency or not.
>
> Finally, a sound technical reason against hard affinity. Thank you.
>
> Which only becomes a problem if you run two programs using hard affinity at
> the same time which try to use the same cores/threads. Otherwise the
> scheduler will push the non-bound threads on the idle cores.
Doesn't this imply that threads that use hard affinity get higher
priority than any thread that doesn't? Isn't this exactly the opposite
of what you want for number crunching? The heavy lifting should run
with low priority to avoid affecting system responsiveness.
-Truls
Other related posts:
