‫الجامعة السعودية االلكترونية‬

‫الجامعة السعودية االلكترونية‬

‫‪26/12/2021‬‬
College of Computing and Informatics
OPERATING SYSTEMS
Operating Systems
Module 3

Chapter 4: CPU Scheduling

CONTENTS
 Basic Concepts

 Scheduling Criteria

 Scheduling Algorithms

 Thread Scheduling

 Multi-Processor Scheduling
Weekly LEARNING OUTCOMES
 Describe CPU scheduling algorithms and their differences.

 Evaluate CPU scheduling algorithms based on scheduling criteria

 Explain the issues related to multiprocessor and multicore scheduling

 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
Large number of short bursts

Small number of longer bursts

 CPU SCHEDULER
• The CPU scheduler selects from among the processes in ready queue, and
allocates a CPU core to one of them
• Queue may be ordered in various ways
• CPU scheduling decisions may take place when a process:
• Switches from running to waiting state
• Switches from running to ready state
• Switches from waiting to ready
• Terminates
• For situations 1 and 4, there is no choice in terms of scheduling. A new process (if
one exists in the ready queue) must be selected for execution.
• For situations 2 and 3, however, there is a choice.
 PREEMPTIVE AND NONPREEMPTIVE SCHEDULING
• When scheduling takes place only under circumstances 1 and 4, the
scheduling scheme is nonpreemptive.
• Otherwise, it is preemptive.
• Under Nonpreemptive scheduling, once the CPU has been allocated
to a process, the process keeps the CPU until it releases it either by
terminating or by switching to the waiting state.
• Virtually all modern operating systems including Windows, MacOS,
Linux, and UNIX use preemptive scheduling algorithms.
 PREEMPTIVE SCHEDULING AND RACE CONDITIONS
• Preemptive scheduling can result in race conditions when data are
shared among several processes.
• Consider the case of two processes that share data. While one process
is updating the data, it is preempted so that the second process can run.
The second process then tries to read the data, which are in an
inconsistent state.
• This issue will be explored in detail in Chapter 6.
 DISPATCHER
• Dispatcher module gives control of the CPU
to the process selected by the CPU
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 (Max)
• Throughput – # of processes that complete their execution per time unit
(Max)
• Turnaround time – amount of time to execute a particular process (Min)
• Waiting time – amount of time a process has been waiting in the ready
queue (Min)
• Response time – amount of time it takes from when a request was
submitted until the first response is produced. (Min)
 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
Waiting time for P1 = 0; P2 = 24; P3 = 27
0 24 27 30
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
 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
• Preemptive version called shortest-remaining-time-first
• How do we determine the length of the next CPU burst?
• Could ask the user
• Estimate
 EXAMPLE OF SJF
ProcessArriva l Time Burst Time
P1 0.0 6
P2 2.0 8
P3 4.0 7
P4 5.0 3
SJF scheduling chart

P4 P1 P3 P2
0 3 9 16 24

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

 COMPUTER STARTUP
• Bootstrap program is loaded at power-up or reboot
• Typically stored in ROM or EPROM, generally known as firmware
• Initializes all aspects of system
• Loads operating system kernel and starts execution
 DETERMINING LENGTH OF NEXT CPU BURST

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 :

Commonly, α set to ½
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
EXAMPLE OF SHORTEST-REMAINING-TIME-FIRST

Now we add the concepts of varying arrival times and preemption to the analysis
ProcessA arri 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

 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
Process Burst Time
P1 24
P2 3
P3 3
The Gantt chart is:

P1 P2 P3 P1 P1 P1 P1 P1
0 4 7 10 14 18 22 26 30

Typically, higher average turnaround than SJF, but better response

q should be large compared to context switch time
q usually 10 milliseconds to 100 milliseconds,
Context switch < 10 microseconds
TIME QUANTUM AND CONTEXT SWITCH TIME
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
ProcessA arri Burst TimeT 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

 PRIORITY SCHEDULING W/ ROUND-ROBIN
ProcessA arri Burst TimeT Priority
P1 4 3
P2 5 2
P3 8 2
P4 7 1
P5 3 3
Run the process with the highest priority. Processes with the same priority run round-robin
Gantt Chart with time quantum = 2
MULTILEVEL QUEUE
With priority scheduling, have separate queues for each priority.
Schedule the process in the highest-priority queue!
MULTILEVEL QUEUE
• Prioritization based upon process type
MULTILEVEL FEEDBACK QUEUE
• Three queues:
• Q0 – RR with time quantum 8
milliseconds
• Q1 – RR time quantum 16
milliseconds
• Q2 – FCFS
• Scheduling
• A new process enters queue
Q0 which is served in RR
• When it gains CPU, the
process receives 8
THREAD SCHEDULING
• Distinction between user-level and kernel-level threads
• When threads supported, threads scheduled, not processes
• Many-to-one and many-to-many models, thread library
schedules user-level threads to run on LWP
• Known as process-contention scope (PCS) since scheduling
competition is within the process
• Typically done via priority set by programmer
• Kernel thread scheduled onto available CPU is system-
contention scope (SCS) – competition among all threads in
system
MULTIPLE-PROCESSOR SCHEDULING
• Symmetric multiprocessing (SMP) is where each processor is self
scheduling.
• All threads may be in a common ready queue (a)
• Each processor may have its own private queue of threads (b)
MULTICORE PROCESSORS
• Recent trend to place multiple processor cores on same physical chip
• Faster and consumes less power
• Multiple threads per core also growing
• Takes advantage of memory stall to make progress on another thread while
memory retrieve happens
• Figure
MULTITHREADED MULTICORE SYSTEM
• Each core has > 1 hardware threads.
• If one thread has a memory stall, switch to another thread!
• Figure
MULTITHREADED MULTICORE SYSTEM
• Chip-multithreading (CMT) assigns
each core multiple hardware
threads. (Intel refers to this as
hyperthreading.)

• On a quad-core system with 2

hardware threads per core, the
operating system sees 8 logical
processors.
MULTITHREADED MULTICORE SYSTEM
Two levels of scheduling:

The operating system deciding

which software thread to run on a
logical CPU

How each core decides which

hardware thread to run on the
physical core.
MULTIPLE-PROCESSOR SCHEDULING – LOAD BALANCING

• If SMP, need to keep all CPUs loaded for efficiency

• Load balancing attempts to keep workload evenly distributed
• Push migration – periodic task checks load on each processor, and if
found pushes task from overloaded CPU to other CPUs
• Pull migration – idle processors pulls waiting task from busy processor
MULTIPLE-PROCESSOR SCHEDULING – PROCESSOR AFFINITY

• When a thread has been running on one processor, the cache contents of that
processor stores the memory accesses by that thread.
• We refer to this as a thread having affinity for a processor (i.e., “processor
affinity”)
• Load balancing may affect processor affinity as a thread may be moved from one
processor to another to balance loads, yet that thread loses the contents of what
it had in the cache of the processor it was moved off of.
• Soft affinity – the operating system attempts to keep a thread running on the
same processor, but no guarantees.
• Hard affinity – allows a process to specify a set of processors it may run on.
NUMA AND CPU SCHEDULING
If the operating system is NUMA-aware, it will assign memory closes to
the CPU the thread is running on.
 Required Reading
1. Chapter 5: CPU Scheduling (Operating System Concepts by
Silberschatz, Abraham, et al. 10th ed., ISBN: 978-1-119-32091-3,
2018)

Recommended Reading
1. Chapter 2.4 (Modern Operating Systems by Andrew S. Tanenbaum and
Herbert Bos. 4th ed., ISBN-10: 0-13-359162-X, ISBN-13: 978-0-13-
359162-0, 2015)

This Presentation is mainly dependent on the textbook: Operating System Concepts by Silberschatz, Abraham, et al. 10th ed
Thank You