On Mon, Mar 17, 2003 at 11:55:36AM -0500, gabriel rosenkoetter wrote:
>
> On Mon, Mar 17, 2003 at 08:39:36AM +0000, David Laight wrote:
> > One thing I didn't mention is that the old pid allocation code is
> > actually at least o(n^2) in the number of allocated pids.
> > The new code is o(1).
>
> Do you actually mean little-o? If so, what's your k? (How many procs
> need to exist before the algorithm's o(1)?)
>
I read it as o(n), and I'm sure so did Jason :-)
++L