[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

* Peter Zijlstra <> wrote:

> 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).

We can go even further than that, IIRC all physical states of
this universe fit into a roughly 2^1000 finite state-space, so
every computing problem in this universe is O(2^1000), i.e.
every computing problem we can ever work on is O(1).

Really, I think Andrea is missing the big picture here.



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