Chapter 5: CPU Scheduling: Silberschatz, Galvin and Gagne ©2009 Operating System Concepts - 8 Edition

Chapter 5: CPU Scheduling
Operating System Concepts – 8th Edition, Silberschatz, Galvin and Gagne ©2009
Outline
 Basic Concepts
 Scheduling Criteria
 Scheduling Algorithms
 Thread Scheduling
 Multiple-Processor Scheduling
 OS Examples
 Algorithm Evaluation
Operating System Concepts – 8th Edition 5.2 Silberschatz, Galvin and Gagne ©2009
Objectives
 To introduce CPU scheduling, which is the basis for
multiprogrammed OS
 To describe various CPU-scheduling algorithms
 To discuss evaluation criteria for selecting a CPU-
scheduling algorithm for a particular system
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 distribution
Histogram of CPU-burst Times
Alternating Sequence of CPU and I/O Bursts
CPU Scheduler
 Selects from among the processes in memory that are
ready to execute, and allocates the CPU to one of them
 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 only under 1 and 4 is nonpreemptive
 All other scheduling is preemptive
Dispatcher
 Dispatcher module gives CPU control 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
CPU SCHEDULING First Come
First Serve
EXAMPLE DATA: (FCFS)
Process Arrival Service
Time Time (Burst Time)
P1 0 8
P2 1 4
P3 2 9
P4 3 5
Suppose that the processes arrive in the order: P1 , P2 , P3, P4 … if
there is no arrival time described in question, this statement enough.
P1 P2 P3 P4
0 8 12 21 26
Waiting time for Particular Process P1(0), P2(8), P3(12) and P4(21)
Average waiting Time = ( 0+8+ 12+ 21)/4 = 41/4 = 10.25
Residence Time
at the CPU
First Serve
P1 0 8
P2 1 4
P3 2 9
P4 3 5
Suppose that the processes arrive in the order: P1 , P2 , P3, P4 … if
there is no arrival time described in question, this statement enough.
P1 P2 P3 P4
0 8 12 21 26
Waiting time for P1(0), P2(8), P3(12) and P4(21)
Average wait = ( 0+8+ 12+ 21)/4 = 41/4 = 10.25
Residence Time
at the CPU
First Serve
P1 0 8
P3 1 4
P4 2 9
P2 3 5
Suppose that the processes arrive in the order: P1 , P3 , P4, P2 … in this
example we change the order of the processes.
P1 P3 P4 P2
Waiting time for P1(?), P2(?), P3(?) and P4(?)

Average wait = ( ?+?+ ?+ ?)/? = ?/? = ?
Residence Time
at the CPU
First Serve
P4 0 8
P1 1 4
P3 2 9
P2 3 5
Suppose that the processes arrive in the order: P1 , P3 , P4, P2 … in this
example we change the order of the processes.
P4 P1 P3 P2
0 8 12 21 26
Average wait = ( 0+21+ 8+ 12)/4 = 41/4 = 10.25
Residence Time
at the CPU
First Serve
P1 0 4
P3 1 9
P4 2 5
P2 3 8
In this example we change the burst time of the process.
P1 P3 P4 P2

Average wait = ( 0+18+ 4+ 13)/4 = 35/4 = 8.75
Residence Time
at the CPU
First Serve
P1 0 4
P3 1 9
P4 2 5
P2 3 8
In this example we change the burst time of the process.
P1 P3 P4 P2
0 4 13 18 26
Average wait = ( 0+18+ 4+ 13)/4 = 35/4 = 8.75
Residence Time
at the CPU
First-Come, First-Served (FCFS) Scheduling
Process Burst Time

P1 3 24
P2 3
P3
 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
Shortest-Job-First (SJF) Scheduling
 Associate with each process the length of its next CPU
burst
 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
Example of SJF
Process Burst Time
P1 6
P2 8
P3 7
P4 3
 SJF scheduling chart
P4 P1 P3 P2
0 3 9 16 24
 Average waiting time = (3 + 16 + 9 + 0) / 4 = 7
Determining Length of Next CPU Burst
 Can only estimate the length

 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 .
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
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 a priority scheduling where 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
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
 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
 Performance
 q large  FCFS
 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
Time Quantum and Context Switch Time
Turnaround Time Varies with the Time Quantum
Multilevel Queue
 Ready queue is partitioned into separate queues:

foreground (interactive)
background (batch)
 Each queue has its own scheduling algorithm
 foreground – RR
 background – FCFS
 Scheduling must be done among the queues
 Fixed priority scheduling: to 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 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 with 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
Multilevel Feedback Queues
Thread Scheduling
 Distinction between user-level and kernel-level

threads
 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
 Kernel thread scheduled onto available CPU is
system-contention scope (SCS) – competition
among all threads in system
Pthread Scheduling
 API allows specifying either PCS or SCS during

thread creation
 PTHREAD_SCOPE_PROCESS schedules threads using
PCS scheduling
 PTHREAD_SCOPE_SYSTEM schedules threads using SCS
scheduling
Pthread Scheduling API (Fig. 5.8)
#include <pthread.h>
#include <stdio.h>
#define NUM_THREADS 5
int main(int argc, char *argv[])
{
int i;
pthread t tid[NUM_THREADS];
pthread_attr t_attr;
/* get the default attributes */
pthread_attr_init(&attr);
/* set the scheduling algorithm to PROCESS or SYSTEM*/
pthread_attr_setscope(&attr, PTHREAD_SCOPE_SYSTEM);
/* set the scheduling policy - FIFO, RT, or OTHER */
pthread_attr_setschedpolicy(&attr, SCHED_OTHER);
Pthread Scheduling API
/* create the threads */

for (i = 0; i < NUM_THREADS; i++)
pthread_create(&tid[i],&attr,runner,NULL);
/* now join on each thread */
for (i = 0; i < NUM_THREADS; i++)
pthread_join(tid[i], NULL);
}
/* Each thread will begin control in this function */
void *runner(void *param)
{
printf("I am a thread\n");
pthread_exit(0);
}
Multiple-Processor Scheduling
 CPU scheduling more complex when multiple

CPUs are available
 Homogeneous processors within a multiprocessor
 Approach
 Asymmetric multiprocessing – only one processor
accesses the system data structures, alleviating the need
for data sharing
 Symmetric multiprocessing (SMP) – each processor is
self-scheduling, all processes in common ready queue, or
each has its own private queue of ready processes
 Processor affinity – process has affinity for
processor on which it is currently running
 soft affinity
 hard affinity
NUMA and CPU Scheduling
NUMA: Non-Uniform Memory Access
Multicore Processors
 Recent trend to place multiple processor cores on same
physical chip
 Faster and consume less power
 Multiple hardware threads per core also growing
 Takes advantage of memory stall to make progress on another
thread while memory retrieve happens
Multithreaded Multicore System
OS Examples
 Solaris scheduling
 Windows XP scheduling
 Linux scheduling
Solaris Dispatch Table
Solaris Scheduling
Windows XP Priorities
Priority Classes
Relative Priority
Linux Scheduling
 Constant order O(1) scheduling time

 After kernel version 2.5
 Two priority ranges: time-sharing and real-time
 Real-time range from 0 to 99
 Nice value from 100 to 140
Priorities and Time-slice Length (Fig. 5.15)
List of Tasks Indexed According to Priorities
Algorithm Evaluation
 Deterministic modeling – takes a particular

predetermined workload and defines the performance of
each algorithm for that workload
 Simple and fast
 Answers only apply to the cases
 Queueing models
 Classes of algorithms and distributions are limited
 Simulations
 Programming a model of the system
 Expensive
 Implementation
 High cost for coding and modifying the OS
Evaluation of CPU Schedulers by Simulation
End of Chapter 5
Operating System Concepts – 8th Edition, Silberschatz, Galvin and Gagne ©2009
5.08
In-5.7
In-5.8
In-5.9
Dispatch Latency
Java Thread Scheduling
 JVM Uses a Preemptive, Priority-Based Scheduling

Algorithm
 FIFO Queue is Used if There Are Multiple Threads With

the Same Priority
Java Thread Scheduling (cont)
JVM Schedules a Thread to Run When:
1. The Currently Running Thread Exits the Runnable State

2. A Higher Priority Thread Enters the Runnable State
* Note – the JVM Does Not Specify Whether Threads are

Time-Sliced or Not
Time-Slicing
Since the JVM Doesn’t Ensure Time-Slicing, the yield()

Method
May Be Used:
while (true) {
// perform CPU-intensive task
...
Thread.yield();
}
This Yields Control to Another Thread of Equal Priority
Thread Priorities
Priority Comment
Thread.MIN_PRIORITY Minimum Thread Priority
Thread.MAX_PRIORITY Maximum Thread
Priority
Thread.NORM_PRIORITY Default Thread Priority
Priorities May Be Set Using setPriority() method:

setPriority(Thread.NORM_PRIORITY + 2);
Solaris 2 Scheduling

Chapter 5: CPU Scheduling: Silberschatz, Galvin and Gagne ©2009 Operating System Concepts - 8 Edition

Uploaded by

Copyright:

Available Formats

Chapter 5: CPU Scheduling: Silberschatz, Galvin and Gagne ©2009 Operating System Concepts - 8 Edition

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 5: CPU Scheduling: Silberschatz, Galvin and Gagne ©2009 Operating System Concepts - 8 Edition

Uploaded by

Copyright:

Available Formats

Chapter 5: CPU Scheduling

 Maximum CPU utilization obtained with

 Dispatcher module gives CPU control to the

 Max CPU utilization

Waiting time for P1(?), P2(?), P3(?) and P4(?)

Waiting time for P1(0), P2(18), P3(4) and P4(13)

Process Burst Time

Suppose that the processes arrive in the order

 Waiting time for P1 = 6; P2 = 0; P3 = 3

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

 Can only estimate the length

1. t n  actual length of n th CPU burst

 Since both  and (1 - ) are less than or equal to 1, each successive

 Each process gets a small unit of CPU time (time

Process Burst Time

 The Gantt chart is:

 Typically, higher average turnaround than SJF, but better

 Ready queue is partitioned into separate queues:

 A process can move between various queues;

 Distinction between user-level and kernel-level

 API allows specifying either PCS or SCS during

/* create the threads */

 CPU scheduling more complex when multiple

NUMA: Non-Uniform Memory Access

 Constant order O(1) scheduling time

 Deterministic modeling – takes a particular

 JVM Uses a Preemptive, Priority-Based Scheduling

 FIFO Queue is Used if There Are Multiple Threads With

JVM Schedules a Thread to Run When:

1. The Currently Running Thread Exits the Runnable State

* Note – the JVM Does Not Specify Whether Threads are

Since the JVM Doesn’t Ensure Time-Slicing, the yield()

This Yields Control to Another Thread of Equal Priority

Priorities May Be Set Using setPriority() method:

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.