Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!watmath!clyde!cbosgd!ihnp4!qantel!lll-lcc!lll-crg!seismo!brl-sem!brl-smoke!smoke!rbj@icst-cmr.arpa From: rbj@icst-cmr.arpa (root) Newsgroups: net.unix-wizards Subject: Pids Message-ID: <266@brl-smoke.ARPA> Date: Thu, 24-Apr-86 19:37:49 EDT Article-I.D.: brl-smok.266 Posted: Thu Apr 24 19:37:49 1986 Date-Received: Tue, 6-May-86 04:29:37 EDT Sender: news@brl-smke.ARPA Lines: 19 I just finished reading McKusick's paper on `Measuring & Improving the Performance of 4.2'. One of the things he dicusses is searching the PROC tables when assigning PIDS for uniqueness. I offer the following observations: 1) Pids seem to wrap at 32K. 2) I have only observed this once, as our machine usually finds an excuse to crash, or we reboot it for somne reason. Even so, it took more than a week. 3) Until the wrap around, *each pid generated (++pid) is guaranteed to be unique*! 4) My solution is to have a flag (pidwrap) which is set at the obvious time. If the flag is clear, *why search at all*? If not, do it the hard way. 5) Any reason not to use unsigned pids, this doubling their range? 6) Has my brain been swapped out? Am I missing something? (Root Boy) Jim Cottrell "One man gathers what another man spills"