queue. If the highest-priority queue contains multiple threads, then
they run in ``round robin'' order.
+Multiple facets of the scheduler require data to be updated after a
+certain number of timer ticks. In every case, these updates should
+occur before any ordinary kernel thread has a chance to run, so that
+there is no chance that a kernel thread could see a newly increased
+@func{timer_ticks} value but old scheduler data values.
+
@menu
* Thread Niceness::
* Calculating Priority::
The initial thread starts with a @var{nice} value of zero. Other
threads start with a @var{nice} value inherited from their parent
-thread. You
-must implement these functions, for which we have provided skeleton
-definitions in @file{threads/thread.c}.
+thread. You must implement the functions described below, which are for
+use by test programs. We have provided skeleton definitions for them in
+@file{threads/thread.c}. by test programs
@deftypefun int thread_get_nice (void)
Returns the current thread's @var{nice} value.