Messages in this thread | | | Date | Wed, 08 Jan 2014 16:37:49 +0800 | From | Alex Shi <> | Subject | Re: [RFC] sched: CPU topology try |
| |
On 01/07/2014 11:37 PM, Morten Rasmussen wrote: >>> > > >>> > > So something like: >>> > > >>> > > avg = runnable + p(i) * blocked; where p(i) \e [0,1] >>> > > >>> > > could maybe be used to replace the cpu_load array and still represent >>> > > the concept of looking at a bigger picture for larger sets. Leaving open >>> > > the details of the map p. > Figuring out p is the difficult bit. AFAIK, with blocked load in its > current form we don't have any clue when a task will reappear.
Yes, that's why we can not find a suitable way to consider the blocked load in load balance.
-- Thanks Alex
| |