Operating Systems
Lecture 4 - CPU Scheduling
1
Outline
Scheduling Objectives
Scheduling Criteria
Scheduling Algorithms
FCFS, Shortest Job First, Priority, Round Robin, Multilevel
Real-time Scheduling
Algorithm Evaluation
2
Process Scheduling
3
Scheduling Objectives
Enforcement of fairness
in allocating resources to processes
Enforcement of priorities
Make best use of available system resources
Give preference to processes holding key resources.
Give preference to processes exhibiting good behavior.
Degrade gracefully under heavy loads.
4
CPU Scheduler
Selects from among the processes in memory that are ready
to execute, and allocates the CPU to one of them.
Non-preemptive Scheduling
Once CPU has been allocated to a process, the process keeps the CPU until
Process exits OR
Process switches to waiting state
Preemptive Scheduling
Process can be interrupted and must release the CPU.
5
CPU Scheduling Decisions
CPU scheduling decisions may take place when a process:
switches from running state to waiting state
switches from running state to ready state
switches from waiting to ready
terminates
Scheduling under 1 and 4 is non-preemptive.
All other scheduling is preemptive.
6
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.
Dispatcher must be fast.
7
Scheduling Criteria
CPU Utilization
Keep the CPU and other resources as busy as possible
Throughput
# of processes that complete their execution per time unit.
Turnaround time
amount of time to execute a particular process from its entry time.
8
Scheduling Criteria (cont.)
Waiting time
amount of time a process has been waiting in the ready queue.
Response Time (in a time-sharing environment)
amount of time it takes from when a request was submitted until the first
response/reaction is produced, NOT output.
9
Optimization Criteria
Max CPU Utilization
Max Throughput
Min Turnaround time
Min Waiting time
Min response time
10
First Come First Serve (FCFS) Scheduling
Policy: Process that requests the CPU FIRST
is allocated the CPU FIRST.
FCFS is a non-preemptive algorithm.
Implementation - using FIFO queues
incoming process is added to the tail of the queue.
Process selected for execution is taken from head of
queue.
Performance metric - Average waiting time in
queue.
Gantt Charts are used to visualize schedules.
11
First-Come, First-Served(FCFS) Scheduling
Example Suppose the arrival order for the
processes is
Process Burst Time
P1 24
P1, P2, P3
P2
P3
3
3
Waiting time
P1 = 0;
P2 = 24;
Gantt Chart for Schedule
P3 = 27;
P1 P2 P3
Average waiting time
0 24 27 30 (0+24+27)/3 = 17
12
FCFS Scheduling (cont.)
Example Suppose the arrival order for the
processes is
P2, P3, P1
Process Burst Time
P1 24 Waiting time
P2 3 P1 = 6; P2 = 0; P3 = 3;
P3 3
Average waiting time
Gantt Chart for Schedule
(6+0+3)/3 = 3 , better..
Convoy Effect:
P2 P3 P1
short process behind long process, e.g. 1
0 3 6 CPU bound process, many I/O bound
30 processes.
13
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.
Two Schemes:
Scheme 1: Non-preemptive
Once CPU is given to the process it cannot be preempted until it completes its CPU
burst.
Scheme 2: Preemptive
If a new CPU process arrives with CPU burst length less than remaining time of
current executing process, preempt. Also called Shortest-Remaining-Time-First
(SRTF).
SJF is optimal - gives minimum average waiting time for a given set of
processes.
14
Non-Preemptive SJF Scheduling
Example
Process Arrival TimeBurst Time
P1 0 7
P2 2 4
P3 4 1
P4 5 4
Gantt Chart for Schedule
P1 P3 P2 P4
0 7 8 12 16
Average waiting time =
(0+6+3+7)/4 = 4
15
Preemptive SJF Scheduling(SRTF)
Example
Process Arrival TimeBurst Time
P1 0 7
P2 2 4
P3 4 1
P4 5 4
Gantt Chart for Schedule
P1 P2 P3 P2 P4 P1
0 2 4 5 7 11 16
Average waiting time =
(9+1+0+2)/4 = 3
16
Priority Scheduling
A priority value (integer) is associated with each process. Can
be based on
Cost to user
Importance to user
Aging
%CPU time used in last X hours.
CPU is allocated to process with the highest priority.
Preemptive
Nonpreemptive
17
Priority Scheduling (cont.)
SJN is a priority scheme where the priority is the predicted
next CPU burst time.
Problem
Starvation!! - Low priority processes may never execute.
Solution
Aging - as time progresses increase the priority of the process.
18
Round Robin (RR)
Each process gets a small unit of CPU time
Time quantum usually 10-100 milliseconds.
After this time has elapsed, the process is preempted and added to the end of the
ready queue.
n processes, time quantum = q
Each process gets 1/n CPU time in chunks of at most q time units at a time.
No process waits more than (n-1)q time units.
Performance
Time slice q too large - FIFO behavior
Time slice q too small - Overhead of context switch is too expensive.
19
Round Robin Example
Time Quantum = 20
Process Burst Time
P1 53
P2 17
P3 68
P4 24
Gantt Chart for Schedule
P1 P2 P3 P4 P1 P3 P4 P1 P3 P3
0 20 37 57 77 97 117 121 134 154 162
Typically, higher average turnaround time than SRTF, but better response
20
Multilevel Queue
Ready Queue partitioned into separate queues
Example: system processes, foreground (interactive), background (batch), student
processes….
Each queue has its own scheduling algorithm
Example: foreground (RR), background(FCFS)
Processes assigned to one queue permanently.
Scheduling must be done between the queues
Fixed priority - serve all from foreground, then from background. Possibility of starvation.
Time slice - Each queue gets some CPU time that it schedules - e.g. 80% foreground(RR),
20% background (FCFS)
21
Multilevel Queues
22
Linux Scheduling
Completely Fair Scheduler (CFS)
Virtual Runtime: Each process is assigned a virtual runtime value, which represents the
amount of CPU time it has received.
The scheduler tries to keep the virtual runtimes of processes balanced.
Time Slicing: The CFS algorithm utilizes a concept known time slice to ensure that all
processes get a fair chance to run.
The default time slice is usually around 1 millisecond, but it can be dynamically adjusted based
on system load and configuration.
23
Linux Scheduling…
The Virtual Runtime (VRuntime) in the Completely Fair Scheduler (CFS) is a
value that represents the amount of CPU time a process has received. It plays a
crucial role in determining process priorities and scheduling decisions. The CFS
uses the concept of virtual runtime to achieve fairness and proportionate
allocation of CPU time among processes.
The Virtual Runtime is determined based on the following factors and principles:
1. Initial Assignment: When a process is created or becomes eligible for execution, it is initially
assigned a virtual runtime of zero.
2. Scheduling Decisions: The CFS scheduler makes scheduling decisions by comparing the
virtual runtimes of processes. The process with the smallest virtual runtime is selected to run
next.
3. Time Slice Consumption: When a process is executing on the CPU, it consumes a portion of
its time slice. The consumed time is added to the process's virtual runtime.
24
Algorithm Evaluation
Deterministic Modeling
Takes a particular predetermined workload and defines the performance of each algorithm
for that workload. Too specific, requires exact knowledge to be useful.
Queuing Models and Queuing Theory
Use distributions of CPU and I/O bursts. Knowing arrival and service rates - can compute
utilization, average queue length, average wait time etc…
Little’s formula - n = W where n is the average queue length, is the avg. arrival rate and
W is the avg. waiting time in queue.
Other techniques: Simulations, Implementation
25
Which type of scheduling algorithm is used by windows 10?
………..
26
