A 1.3.3 Comparing Approaches to Scheduling (SL and HL)
When several processes are ready at once, only one can use the processor, so the operating system has to choose an order, and that choice changes how long users wait and how much time is lost switching between tasks. This lesson compares the four scheduling approaches by tracing a single job set through each. The command term is compare, so the approaches are held side by side rather than described in turn. I have...