Sunteți pe pagina 1din 15

Chapter#5, Process Scheduling

SSUET/QR/111

Operating System (CE-303)


5 - CPU Scheduling Muhammad Rehan Rasheed Assistant Professor, CED

Chapter 5: CPU Scheduling


Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm Evaluation

CE-303

Instructor: M. Rehan Rasheed

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

Objectives
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 CPUscheduling algorithm for a particular system

CE-303

Instructor: M. Rehan Rasheed

Basic Concepts
Maximum CPU utilization obtained with multiprogramming

CPUI/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait
CPU burst distribution

CE-303

Instructor: M. Rehan Rasheed

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

Alternating Sequence of CPU and I/O Bursts

CE-303

Instructor: M. Rehan Rasheed

CPU 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. 2. 3. 4. Switches from running to waiting state Switches from running to ready state Switches from waiting to ready Terminates

Scheduling under 1 and 4 is non-preemptive All other scheduling is preemptive


Consider access to shared data Consider preemption while in kernel mode Consider interrupts occurring during crucial OS activities
CE-303 Instructor: M. Rehan Rasheed 6

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

Preemptive and Non-Preemptive.


In general, scheduling policies may be preemptive or non- preemptive. A scheduling discipline is nonpreemptive if, once a process has been given the CPU, the CPU can not be taken away from that process. Preemptive scheduling is useful in systems in which high-priority processes require rapid-attention.
Instructor: M. Rehan Rasheed 7

CE-303

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.

CE-303

Instructor: M. Rehan Rasheed

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

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 timesharing environment)

CE-303

Instructor: M. Rehan Rasheed

Scheduling Algorithm Optimization Criteria


Max CPU utilization Max throughput Min turnaround time Min waiting time Min response time

CE-303

Instructor: M. Rehan Rasheed

10

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

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 0 24 P2 27 P3 30

Waiting time for P1 = 0; P2 = 24; P3 = 27(milliseconds) Average waiting time: (0 + 24 + 27)/3 = 17(milliseconds)
CE-303 Instructor: M. Rehan Rasheed 11

FCFS Scheduling (Cont.)


Suppose that the processes arrive in the order: P2 , P3 , P 1 The Gantt chart for the schedule is:

P2 0 3

P3 6

P1 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

FCFS scheduling Algorithm is non-preemptive.


CE-303 Instructor: M. Rehan Rasheed 12

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

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

CE-303

Instructor: M. Rehan Rasheed

13

Example of Non-Preemptive SJF


Process Arrival Time P1 0.0 P2 2.0 P3 4.0 P4 5.0 SJF (non-preemptive)
P1 0 3 7 P3 8

Burst Time 7 4 1 4

P2 12

P4 16

Average waiting time = (0 + 6 + 3 + 7)/4 = 4


CE-303 Instructor: M. Rehan Rasheed 14

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

Example of Preemptive SJF


Process Arrival Time P1 0.0 P2 2.0 P3 4.0 P4 5.0 SJF (preemptive)
P1 0 2 P2 4 P3 5 P2 7

Burst Time 7 4 1 4
P4 11 P1 16

Average waiting time = (9 + 1 + 0 +2)/4 = 3


CE-303 Instructor: M. Rehan Rasheed 15

Example of Shortest-remaining-time-first
Now we add the concepts of varying arrival times and preemption to the analysis Processarri Arrival Time Burst Time P1 0 8 P2 1 4 P3 2 9 P4 3 5 Preemptive SJF Gantt Chart
P1 0 1 P2 5 P4 10 P1 17 P3 26

Average waiting time = (9 + 0 + 15 +2)/4 = 6.5 milliseconds.


CE-303 Instructor: M. Rehan Rasheed 16

OS - CE-303

Average waiting time = [(10-1)+(1-1)+(17-2)+5-

Chapter#5, Process Scheduling

SSUET/QR/111

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
CE-303 Instructor: M. Rehan Rasheed 17

Example of Priority Scheduling


Processarri Burst TimeT Priority P1 10 3 P2 1 1 P3 2 4 P4 1 5 P5 5 2
P2 0 1 P5 6 P1 P3 16 P4 18 19

Priority scheduling Gantt Chart Average waiting time = (0 + 1 + 6 + 16 + 18)/5 = 8.2 milliseconds.
CE-303 Instructor: M. Rehan Rasheed 18

OS - CE-303

Chapter#5, Process Scheduling

SSUET/QR/111

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
CE-303 Instructor: M. Rehan Rasheed 19

Example of RR with Time Quantum = 4


Process P1 P2 P3
P1 0 4 P2 7 P3 10 P1 14

Burst Time 24 3 3
P1 P1 18 22 P1 26 P1 30

The Gantt chart is: Average waiting time = (6 + 4 + 7)/3 = 5.66 milliseconds.

CE-303

Instructor: M. Rehan Rasheed

20

OS - CE-303

Typically, higher average turnaround than

10

Chapter#5, Process Scheduling

SSUET/QR/111

Example of RR with Time Quantum = 20


Process P1 P2 P3 P4 The Gantt chart is:
P1 0 20 P2 37 P3 57 P4 77

Burst Time 53 17 68 24

P1 97

P3 117

P4

P1 121 134

P3

P3 154 162

Typically, higher average turnaround than SJF, but better response

CE-303

Instructor: M. Rehan Rasheed

21

Time Quantum and Context Switch Time

CE-303

Instructor: M. Rehan Rasheed

22

OS - CE-303

11

Chapter#5, Process Scheduling

SSUET/QR/111

Turnaround Time Varies With The Time Quantum

CE-303

Instructor: M. Rehan Rasheed

23

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
CE-303 Instructor: M. Rehan Rasheed 24

OS - CE-303

12

Chapter#5, Process Scheduling

SSUET/QR/111

Multilevel Queue Scheduling

CE-303

Instructor: M. Rehan Rasheed

25

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
Instructor: M. Rehan Rasheed 26

CE-303

OS - CE-303

13

Chapter#5, Process Scheduling

SSUET/QR/111

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

CE-303

Instructor: M. Rehan Rasheed

27

Multilevel Feedback Queues

CE-303

Instructor: M. Rehan Rasheed

28

OS - CE-303

14

Chapter#5, Process Scheduling

SSUET/QR/111

Algorithm Evaluation
How to select CPU-scheduling algorithm for an OS? Determine criteria, then evaluate algorithms Deterministic modeling
Type of analytic evaluation Takes a particular predetermined workload and defines the performance of each algorithm for that workload

CE-303

Instructor: M. Rehan Rasheed

29

Queueing Models
Describes the arrival of processes, and CPU and I/O bursts probabilistically
Commonly exponential, and described by mean Computes average throughput, utilization, waiting time, etc

Computer system described as network of servers, each with queue of waiting processes
Knowing arrival rates and service rates Computes utilization, average queue length, average wait time, etc

CE-303

Instructor: M. Rehan Rasheed

30

OS - CE-303

15