-@node Multilevel Feedback Scheduling, Coding Standards, Project 4--File Systems, Top
+@node Multilevel Feedback Scheduling, Coding Standards, References, Top
@appendix Multilevel Feedback Scheduling
This section gives a brief overview of the behavior of the Solaris 2.6
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:
the coarse job runs more frequently, it drops in priority at a faster
rate than the other two jobs.
+@ifnottex
@image{mlfqs1}
+@end ifnottex
+@iftex
+@image{mlfqs1, 3in}
+@end iftex
The impact of this policy on the relative execution times of the three
applications is shown in the next graph below. Because the coarse
the other applications, even though all three jobs require the same
amount of time in a dedicated environment.
+@ifnottex
@image{mlfqs2}
+@end ifnottex
+@iftex
+@image{mlfqs2, 3in}
+@end iftex
@node Project Requirements
@section Project Requirements