|| ||Ingo Molnar <firstname.lastname@example.org>|
|| ||Cort Dougan <email@example.com>|
|| ||Re: [patch] lockless, scalable get_pid(), for_each_process()
|| ||Wed, 18 Sep 2002 17:33:54 +0200 (CEST)|
|| ||William Lee Irwin III <firstname.lastname@example.org>,
Andries Brouwer <email@example.com>,
Linus Torvalds <firstname.lastname@example.org>, <email@example.com>|
On Wed, 18 Sep 2002, Cort Dougan wrote:
> Can we get a lockless, scalable, fault-tolerant, pre-emption safe,
> zero-copy and distributed get_pid() that meets the Carrier Grade
> specification? [...]
of course, and it should also be massively-threaded, LSB-compliant,
enterprise-ready, secure, cluster-aware, power-saving and self-healing. I
admit that there's still lots of work to be done, but there's just so many
hours in a day.
> If at all possible I need it to do garbage collection, too.
actually, on-the-fly O(log(N)) multiprocessor garbage collection is
already integrated into its high-end modular OO design.
> Perhaps a get_pid() that solves the Turning Halting Problem should be on
> the todo list for 2.6.
the first small mystery to solve are certain perturbations in Alan
Turing's name. But, yes, it's definitely a goal of the PID allocator to be
an answer to all, but also for it to avoid infinite loops for every
possible input value, while yielding slightly more subtle output than the
numeric value of 42. Patch in a few minutes.
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to firstname.lastname@example.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
to post comments)