Fix summary.
authorBen Pfaff <blp@cs.stanford.edu>
Fri, 7 Jul 2006 01:14:13 +0000 (01:14 +0000)
committerBen Pfaff <blp@cs.stanford.edu>
Fri, 7 Jul 2006 01:14:13 +0000 (01:14 +0000)
Thanks to Samanth Lingampalli <samanthl@stanford.edu> and Haobo Xu
<haoboxu@stanford.edu> for input.

doc/44bsd.texi

index 2269cdc629eeed0aff0653a3a0412da340bf7458..40fd33db0f469e40811f67e3d02a1805efd29953 100644 (file)
@@ -243,8 +243,7 @@ scheduler.  It is not a complete description of scheduler requirements.
 Every thread has a @var{nice} value between -20 and 20 directly under
 its control.  Each thread also has a priority, between 0
 (@code{PRI_MIN}) through 63 (@code{PRI_MAX}), which is recalculated
-using the following formula whenever the value of either variable term
-changes:
+using the following formula every fourth tick:
 
 @center @t{@var{priority} = @code{PRI_MAX} - (@var{recent_cpu} / 4) - (@var{nice} * 2)}.