lkml.org 
[lkml]   [2011]   [Nov]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
SubjectRe: [PATCH] perf_events: fix and improve x86 event scheduling
From
On Mon, Nov 14, 2011 at 11:16 PM, Peter Zijlstra <peterz@infradead.org> wrote:
> On Mon, 2011-11-14 at 22:43 +0100, Peter Zijlstra wrote:
>>
>> Also, we don't need an exhaustive max flow solution, any flow that's
>> high enough to fit the required capacity will do, this too could
>> possibly be used to lower the (average) complexity bound.
>
> I think that for the typically very dense graphs this in particular
> could be very helpful in keeping the actual runtime low. For a fully
> connected e*c it really doesn't matter how you program things, all flows
> will have the same max and iterating them all is just wasting time.
>
> We just need to figure out which of the many different algorithms are
> best on average for our particular constraint sets.
>
I agree, I think there are optimization opportunities.


\
 
 \ /
  Last update: 2011-11-16 11:09    [W:0.094 / U:0.608 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site