[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CABPqkBSAkeAtswCWHW_ytK9jPf_=P3xYb31PMCrHjxW+eQihYw@mail.gmail.com>
Date: Wed, 16 Nov 2011 11:06:49 +0100
From: Stephane Eranian <eranian@...gle.com>
To: Peter Zijlstra <peterz@...radead.org>
Cc: Robert Richter <robert.richter@....com>,
"linux-kernel@...r.kernel.org" <linux-kernel@...r.kernel.org>,
"mingo@...e.hu" <mingo@...e.hu>,
"ming.m.lin@...el.com" <ming.m.lin@...el.com>,
"ak@...ux.intel.com" <ak@...ux.intel.com>
Subject: Re: [PATCH] perf_events: fix and improve x86 event scheduling
On Mon, Nov 14, 2011 at 11:16 PM, Peter Zijlstra <peterz@...radead.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.
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists