Chapter 9 Uniprocessor Scheduling

Transcription

1 Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 9 Uniprocessor Scheduling Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall

2 Aim of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency

3 Types of Scheduling

4 Scheduling and Process State Transitions

5 Levels of Scheduling

6 Long-Term Scheduling Determines which programs are admitted to the system for processing Controls the degree of multiprogramming More processes, smaller percentage of time each process is executed

7 Medium-Term Scheduling Part of the swapping function Based on the need to manage the degree of multiprogramming

8 Short-Term Scheduling Known as the dispatcher Executes most frequently Invoked when an event occurs Clock interrupts I/O interrupts Operating system calls Signals (eg semaphores)

9 Short-Term Scheduling Criteria User-oriented Response Time Elapsed time between the submission of a request until there is output. System-oriented Effective and efficient utilization of the processor

10 Short-Term Scheduling Criteria Performance-related Quantitative Measurable such as response time and throughput

11 Scheduling Criteria

12 Scheduling Criteria

13 Queuing Diagram

14 Priorities Scheduler will always choose a process of higher priority over one of lower priority Have multiple ready queues to represent each level of priority Lower-priority may suffer starvation Allow a process to change its priority based on its age or execution history

15 Priority Queuing

16 Decision Mode Nonpreemptive Once a process is in the running state, it will continue until it terminates or blocks itself for I/O

17 Decision Mode Preemptive Currently running process may be interrupted and moved to the Ready state by the operating system Allows for better service since any one process cannot monopolize the processor for very long

18 Process Scheduling Example

19 First-Come-First-Served Each process joins the Ready queue When the current process ceases to execute, the process in the Ready queue the longest time is selected

20 First-Come-First-Served A short process may have to wait a very long time before it can execute Favors CPU-bound processes I/O processes have to wait until CPU-bound process completes, while they only need the CPU for a short amount of time after which they will be blocked (can lead to inefficient use of the CPU)

21 Round Robin Uses preemption based on a clock

22 Round Robin Clock interrupt is generated at periodic intervals When an interrupt occurs, the currently running process is placed in the ready queue Next ready job is selected Known as time slicing

23 Effect of Size of Preemption Time Quantum

24 Effect of Size of Preemption Time Quantum

25 Round-Robin (2) Processor-bound processes tend to receive an unfair amount of processor time, this results in poor performance for I/O processes, inefficient use of I/O devices, and increase in variance of response time. Solution, Auxiliary queue that has preference over Ready for processes just released from the Blocked Queues.

26 Queuing Diagram

27 Shortest Process Next Nonpreemptive policy Process with shortest expected processing time is selected next Short process jumps ahead of longer processes

28 Shortest Process Next Predictability of longer processes is reduced If estimated time for process not correct, the operating system may abort it Possibility of starvation for longer processes

29 Shortest Process Next One difficulty is the need to know or at least estimate the required processing time. In a batch job can ask the programmer for an estimate; in a production environment, statistics can be gathered. SS nn+1 = 1 nn nn ii=1 TT ii To avoid recalculating the entire summation each time: SS nn+1 = 1 TT nn nn + nn 1 nn SS nn (equal weight to each instance)

30 Shortest Process Next Exponential Averaging is used to give more weight to more recent values. SS nn+1 = TT nn + 1 SS nn Which expands to: SS nn = TT nn + 1 TT nn ii TT nn ii nn SS 1 Depending on the coefficients are shown next:

31 Exponential Smoothing Coefficients

32 Use Of Exponential Averaging

33 Use Of Exponential Averaging

34 Shortest Remaining Time Preemptive version of shortest process next policy Must estimate processing time

35 Highest Response Ratio Next Choose next process with the greatest ratio This approach is attractive because it accounts for the age of the process. While shorter jobs are favored, aging will help a longer process eventually get past competing shorter jobs.

36 Feedback Penalize jobs that have been running longer by making them move to a lower priority queue at each preemption. The simple method will cause the time for longer processes to grow alarmingly A solution is to increase the time quantum at each priority level. One time unit at RQ0, two at RQ1, 2^i at RQi Don t know remaining time process needs to execute

37 Feedback Scheduling

38 Scheduling Policies w e s Time spent in system so far Time spent in execution so far Total service time required by the process

39 Scheduling Policies

40 Comparison of Scheduling Policies

41 Formulas

42 Normalized Response Time

43 Normalized Response Time

44 Normalized Response Time

45 Normalized Turnaround Time

46 Simulation Result for Waiting Time

47 Fair-Share Scheduling User s application runs as a collection of processes (threads) User is concerned about the performance of the application Need to make scheduling decisions based on process sets

48 Fair-Share Scheduler

49 Traditional UNIX Scheduling Multilevel feedback using round robin within each of the priority queues If a running process does not block or complete within 1 second, it is preempted Priorities are recomputed once per second Base priority divides all processes into fixed bands of priority levels

50 Bands Decreasing order of priority Swapper Block I/O device control File manipulation Character I/O device control User processes

51 Example of Traditional UNIX Process Scheduling