lkml.org 
[lkml]   [2002]   [Sep]   [18]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [patch] lockless, scalable get_pid(), for_each_process() elimination, 2.5.35-BK
On Wed, Sep 18, 2002 at 02:32:06PM +0200, Andries Brouwer wrote:
> I still don't understand the current obsession with this stuff.
> It is easy to have pid_max 2^30 and a fast algorithm that does not
> take any more kernel space.
> It seems to me you are first creating an unrealistic and unfavorable
> situation (put pid_max at some artificially low value, starting a
> lot of tasks and saying: look! the algorithm is quadratic!) and
> then solve the problem that you thus invented yourself.
> Please leave pid_max large.
> Andries

There is no obsession. This just happens to be a real life issue.

Basically, the nondeterministic behavior of these things is NMI oopsing
my machines and those of users (who often just cut the power instead of
running the NMI oopser). get_pid() is actually not the primary offender,
but is known to be problematic along with the rest of them. I don't
really care whose pet algorithm is used so long as it doesn't explode
when breathed on. And Ingo's algorithm looks excellent to me.

This is furthermore blocking VM testing and development for many tasks
scenarios meant to emulate and optimize usage typical of machines in
the field.


Bill
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:03    [W:0.206 / U:26.544 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site