lkml.org 
[lkml]   [2012]   [Mar]   [27]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [PATCH 11/39] autonuma: CPU follow memory algorithm
From
Date
On Mon, 2012-03-26 at 22:39 +0200, Andrea Arcangeli wrote:

> > No, you can't just say that it's limited to some large constant, and thus
> > the same as O(1).
>
> I pointed out it is O(1) just because if we use the O notation we may
> as well do the math right about it.

I think you have a fundamental mis-understanding of the concepts here.
You do not get to fill in n for whatever specific instance of the
problem you have.

The traveling salesman problem can be solved in O(n!), simply because
you know your route will not be larger than 10 houses doesn't mean you
can say your algorithm will be O(10!) and thus O(1).

That's simply not how it works.

You can talk pretty much anything down to O(1) that way. Take an
algorithm that is O(n) in the number of tasks, since you know you have a
pid-space constraint of 30bits you can never have more than 2^30 (aka
1Gi) tasks, hence your algorithm is O(2^30) aka O(1).

> I also would welcome people who knows the scheduler so much better
> than me to rewrite or fix it as they like it.

Again, you seem unclear on how things work, you want this nonsense, you
get to write it.

I am most certainly not going to fix your mess as I completely disagree
with the approach taken.

> I probably wasn't clear enough, but I already implicitly meant it
> shall be optimized further later.

You're in fact very unclear. You post patches without the RFC tag,
meaning you think they're ready to be considered. You write huge
misleading comments instead of /* XXX crap, needs fixing */.

Also, I find your language to be overly obtuse and hard to parse, but
that could be my fault, we're both non-native speakers.


\
 
 \ /
  Last update: 2012-03-27 10:43    [W:0.092 / U:11.900 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site