Messages in this thread | | | Date | Wed, 16 Nov 2011 11:06:49 +0100 | Subject | Re: [PATCH] perf_events: fix and improve x86 event scheduling | From | Stephane Eranian <> |
| |
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.
| |