This document discusses CPU scheduling algorithms. It begins by introducing CPU scheduling and describing basic concepts like CPU bursts and scheduling criteria. It then explains several common scheduling algorithms like first-come first-served, shortest job first, priority scheduling, and round robin. It discusses how to evaluate these algorithms and describes multilevel queue approaches. The key aspects covered are scheduling criteria, example Gantt charts comparing algorithms, and techniques like aging priorities and time quantums.
This document discusses CPU scheduling algorithms. It begins by introducing CPU scheduling and describing basic concepts like CPU bursts and scheduling criteria. It then explains several common scheduling algorithms like first-come first-served, shortest job first, priority scheduling, and round robin. It discusses how to evaluate these algorithms and describes multilevel queue approaches. The key aspects covered are scheduling criteria, example Gantt charts comparing algorithms, and techniques like aging priorities and time quantums.
This document discusses CPU scheduling algorithms. It begins by introducing CPU scheduling and describing basic concepts like CPU bursts and scheduling criteria. It then explains several common scheduling algorithms like first-come first-served, shortest job first, priority scheduling, and round robin. It discusses how to evaluate these algorithms and describes multilevel queue approaches. The key aspects covered are scheduling criteria, example Gantt charts comparing algorithms, and techniques like aging priorities and time quantums.
This document discusses CPU scheduling algorithms. It begins by introducing CPU scheduling and describing basic concepts like CPU bursts and scheduling criteria. It then explains several common scheduling algorithms like first-come first-served, shortest job first, priority scheduling, and round robin. It discusses how to evaluate these algorithms and describes multilevel queue approaches. The key aspects covered are scheduling criteria, example Gantt charts comparing algorithms, and techniques like aging priorities and time quantums.
• To introduce CPU scheduling, which is the basis for
multiprogrammed operating systems • To describe various CPU-scheduling algorithms • To discuss evaluation criteria for selecting a CPU- scheduling algorithm for a particular system • To examine the scheduling algorithms of several operating systems BASIC CONCEPTS • Maximum CPU utilization obtained with multiprogramming • CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU execution and I/O wait • CPU burst followed by I/O burst • CPU burst distribution is of main concern HISTOGRAM OF CPU-BURST TIMES CPU SCHEDULER Short-term scheduler selects from among the processes in ready queue, and allocates the CPU to one of them Queue may be ordered in various ways
CPU scheduling decisions may take place when a process:
1. Switches from running to waiting state 2. Switches from running to ready state 3. Switches from waiting to ready 4. Terminates
Scheduling under 1 and 4 is nonpreemptive
All other scheduling is preemptive Consider access to shared data Consider preemption while in kernel mode Consider interrupts occurring during crucial OS activities DISPATCHER
• Dispatcher module gives control of the CPU to the
process selected by the short-term scheduler; this involves: • switching context • switching to user mode • jumping to the proper location in the user program to restart that program
• Dispatch latency – time it takes for the dispatcher to
stop one process and start another running SCHEDULING CRITERIA
• CPU utilization – keep the CPU as busy as possible
• Throughput – # of processes that complete their execution per time unit • Turnaround time – amount of time to execute a particular process • Waiting time – amount of time a process has been waiting in the ready queue • Response time – amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment) SCHEDULING ALGORITHM OPTIMIZATION CRITERIA
• Max CPU utilization
• Max throughput • Min turnaround time • Min waiting time • Min response time FIRST- COME, FIRST-SERVED (FCFS) SCHEDULING
Process Burst Time
P1 24 P2 3 P3 3 • Suppose that the processes arrive in the order: P1 , P2 , P3 The Gantt Chart for the schedule is: P1 P2 P3 0 24 27 30
• Waiting time for P1 = 0; P2 = 24; P3 = 27
• Average waiting time: (0 + 24 + 27)/3 = 17 FCFS SCHEDULING (CONT.) Suppose that the processes arrive in the order: P2 , P3 , P1 • The Gantt chart for the schedule is:
P2 P3 P1 0 3 6 30
• Waiting time for P1 = 6;P2 = 0; P3 = 3
• Average waiting time: (6 + 0 + 3)/3 = 3 • Much better than previous case • Convoy effect - short process behind long process • Consider one CPU-bound and many I/O-bound processes Shortest-job-first (SJF) Scheduling
• Associate with each process the length of its next
CPU burst • Use these lengths to schedule the process with the shortest time
• SJF is optimal – gives minimum average waiting time
for a given set of processes • The difficulty is knowing the length of the next CPU request • Could ask the user EXAMPLE OF SJF
• Can only estimate the length – should be similar to the previous one • Then pick process with shortest predicted next CPU burst
• Can be done by using the length of previous CPU bursts, using
exponential averaging 1. t n = actual length of n th CPU burst 2. n +1 = predicted value for the next CPU burst 3. , 0 1 4. Define : n =1 = t n + (1 − ) n .
• Commonly, α set to ½ • Preemptive version called shortest-remaining-time-first PREDICTION OF THE LENGTH OF THE NEXT CPU BURST EXAMPLES OF EXPONENTIAL AVERAGING • =0 • n+1 = n • Recent history does not count • =1 • n+1 = tn • Only the actual last CPU burst counts • If we expand the formula, we get: n+1 = tn+(1 - ) tn -1 + … +(1 - )j tn -j + … +(1 - )n +1 0
• Since both and (1 - ) are less than or equal
to 1, each successive term has less weight than its predecessor EXAMPLE OF SHORTEST-REMAINING-TIME-FIRST
• Now we add the concepts of varying arrival times and preemption to the analysis ProcessAarri Arrival TimeT Burst Time P1 0 8 P2 1 4 P3 2 9 P4 3 5 • Preemptive SJF Gantt Chart
P1 P2 P4 P1 P3 0 1 5 10 17 26
• Average waiting time = [(10-1)+(1-1)+(17-2)+5-3)]/4 = 26/4 = 6.5 msec
PRIORITY SCHEDULING • A priority number (integer) is associated with each process
• The CPU is allocated to the process with the highest priority (smallest integer highest priority) • Preemptive • Nonpreemptive
• SJF is priority scheduling where priority is the inverse of predicted next
CPU burst time
• Problem Starvation – low priority processes may never execute
• Solution Aging – as time progresses increase the priority of the process
EXAMPLE OF PRIORITY SCHEDULING Process Arrival Burst Time(T) Priority P1 10 3 P2 1 1 P3 2 4 P4 1 5 P5 5 2
• Priority scheduling Gantt Chart
• Average waiting time = 8.2 msec
ROUND ROBIN (RR) • Each process gets a small unit of CPU time (time quantum q), usually 10-100 milliseconds. After this time has elapsed, the process is preempted and added to the end of the ready queue. • If there are n processes in the ready queue and the time quantum is q, then each process gets 1/n of the CPU time in chunks of at most q time units at once. No process waits more than (n-1)q time units. • Timer interrupts every quantum to schedule next process • Performance • q large FIFO • q small q must be large with respect to context switch, otherwise overhead is too high EXAMPLE OF RR WITH TIME QUANTUM = 4
• Typically, higher average turnaround than SJF, but better
response • q should be large compared to context switch time • q usually 10ms to 100ms, context switch < 10 usec TIME QUANTUM AND CONTEXT SWITCH TIME TURNAROUND TIME VARIES WITH THE TIME QUANTUM
80% of CPU bursts
should be shorter than q ملغي من اول هناMULTILEVEL QUEUE • Ready queue is partitioned into separate queues, eg: • foreground (interactive) • background (batch)
• Process permanently in a given queue
• Each queue has its own scheduling algorithm: • foreground – RR • background – FCFS
• Scheduling must be done between the queues:
• Fixed priority scheduling; (i.e., serve all from foreground then from background). Possibility of starvation. • Time slice – each queue gets a certain amount of CPU time which it can schedule amongst its processes; i.e., 80% to foreground in RR • 20% to background in FCFS MULTILEVEL QUEUE SCHEDULING ملغي MULTILEVEL FEEDBACK QUEUE
ملغي • A process can move between the various queues; aging can be implemented this way • Multilevel-feedback-queue scheduler defined by the following parameters: • number of queues • scheduling algorithms for each queue • method used to determine when to upgrade a process • method used to determine when to demote a process • method used to determine which queue a process will enter when that process needs service EXAMPLE OF MULTILEVEL FEEDBACK QUEUE
• Three queues: ملغي
• Q0 – RR with time quantum 8 milliseconds • Q1 – RR time quantum 16 milliseconds • Q2 – FCFS
• Scheduling • A new job enters queue Q0 which is served FCFS • When it gains CPU, job receives 8 milliseconds • If it does not finish in 8 milliseconds, job is moved to queue Q1 • At Q1 job is again served FCFS and receives 16 additional milliseconds • If it still does not complete, it is preempted and moved to queue Q2 END OF CHAPTER 4
