linux-kernel - Re: [Linux] Linux PID algorithm is BRAINDEAD!

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <CAOCW0Dgi_qbCth6jjOaDSEK_YizaihB4mjEubqTqe=FN=xtvzA@mail.gmail.com>
Date:	Sun, 11 Oct 2015 13:44:02 -0400
From:	Dave Goel <deego3@...il.com>
To:	"Theodore Ts'o" <tytso@....edu>, Dave Goel <deego3@...il.com>,
	linux-kernel@...r.kernel.org
Subject: Re: [Linux] Linux PID algorithm is BRAINDEAD!

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 majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/