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 just the way it is. Then, a PID will wait between N and 2N seconds before getting re-allocated. N could be 5? This method seems to be to eliminate any queues, nor cause any additional bottlenecks or locks? Dave -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
