Ted,
Thanks for your patience with me.
I thought I had this down, and I thought that the only real
problem is *immediate* re-use and the race conditions it causes
and that for all other cases, scripts can find a way to work
around things. But:
But truly, your example stumps me atm.
Completely u
Ted,
Here's a method to achieve the same goal (no immediate pid re-use),
but without using any queues whatsoever:
All freshly available PIDs are entered into PoolA.
Every N seconds, a timer moves PoolA->PoolB, and PoolB->Free PIDs.
And, the current PID allocation algo continues its allocation j
Hi Ted,
Thanks for responding. Fair points all of them.
I would like to take exception to one of them, the bottleneck part:
> The biggest problem is that accessing this free pid queue is now
> a locking bottleneck --- especially on a very large NUMA system
That was exactly what I was trying to
ould not even need to go the queue-mode.. (unless they've been
running many days.)
(Thanks to jd_1 and _mjg on for humoring and discussing this idea when I
presented it on ##kernel.)
Dave Goel (Please CC responses.)
--
To unsubscribe from this list: send the line "unsubscribe linux-
4 matches
Mail list logo
