On Mon, Nov 13, 2000 at 03:37:52PM +0000, Ty Sarna wrote:
> In article <tkrhf5cmxd6.fsf@parity-error.sm.sony.co.jp>,
> enami tsugutomo  <enami@sm.sony.co.jp> wrote:
> > Jason R Thorpe <thorpej@zembu.com> writes:
> > 
> > > On Mon, Nov 13, 2000 at 12:34:28PM +1100, Simon Burge wrote:
> > > 
> > >  > How is proc address allocation done?  LRU?  Just thinking of repeating
> > >  > monte carlo similutions that run in less than a second that do
> > > 
> > > Well, procs are allocated from a pool (pool_get()).  So, a new
> > > proc is going to have the same address as the last one freed.
> > 
> > It's not a strict LRU.  The next one will be allocated from the
> > ``curpage'' and a page the last one freed put back may be a different
> > page than the ``curpage''.
> Increasing the PID space considerably just to have them repeat more
> frequently seems...  bad.  Also, I suspect lots of software assumes PIDs
> won't repeat for a while,

For small values of "a while", kill(1) and top(1). 

	-is