This section gives a brief overview of the behavior of the Solaris 2.6
Time-Sharing (TS) scheduler, an example of a Multilevel Feedback Queue
scheduler. The information in this handout, in conjunction with that
-given in lecture, should be used to answer Problem 1-4. The end of
+given in lecture, should be used to answer Problem 1-3. The end of
this document specifies in more detail which aspects of the Solaris
scheduler that you should implement.
lower priority queues. Processes at the same priority are usually
scheduled in a round-robin fashion.
-Such schedulers tend to be preemptible in order to support interactive
+Such schedulers tend to be preemptible to support interactive
processes. That is, a higher priority process is immediately
scheduled if a lower priority process is running on the CPU.
The @code{kthread_t} structure tracks the necessary information to
context-switch to and from this process. This structure is kept
-separate from the time-sharing class in order to separate the
+separate from the time-sharing class to separate the
mechanisms of the dispatcher from the policies of the scheduler.
There are seven interesting routines in the TS class: