lkml.org 
[lkml]   [2011]   [Nov]   [14]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [PATCH] perf_events: fix and improve x86 event scheduling
From
Date
On Mon, 2011-11-14 at 13:55 +0100, Stephane Eranian wrote:
> I have been talking with co-workers experts in operational research
> about our problem. They all pointed to me to the max flow algorithm from
> Ford-Fulkerson (search for it on Wikipedia). I think it solves the complexity
> and recursion problems. My understanding is that the complexity is also
> more under control.

How would you apply this algorithm to the problem at hand? I'm probably
missing the obvious thing here, but if we want the flow to be the number
of assigned counter then we end up with nodes being the various
permutations of assignments or so, which isn't helpful since that'd be
n! nodes.




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