Process scheduling - how does it work.

[rusty at garnet.berkeley.edu]

In article <8908150138.AA24829 at garnet.berkeley.edu> rusty at GARNET.BERKELEY.EDU writes:

   From: rusty at GARNET.BERKELEY.EDU
   Newsgroups: comp.unix.ultrix
   Subject: Process scheduling - how does it work.
   Date: 15 Aug 89 01:38:41 GMT

   The renicing of long running processes is a crude hack put in by the
   Berkeley people in 4bsd to attempt to improve interactive response at
   the expense of cpu intensive programs which at that time on their
   system probably consisted of troff jobs and such.  The algorithm in
   4bsd is essentially "if the process isn't being run by root and its
   niceness isn't between 0 and 4 then renice it to 4."  Therefore, you
   can either renice it to some negative value (-1 for example) or 1, 2,
   or 3, or have root start it.

Make that "... and its niceness isn't 0 or 4".  (That's what I meant
by crude.)
--

--------------------------------------
	rusty c. wright
	rusty at violet.berkeley.edu ucbvax!violet!rusty