Bilkent University

Department of Computer Engineering

CS342 Operating Systems

Lecture 5
Process Scheduling
(chapter 5)

Dr. İbrahim Körpeoğlu

http://www.cs.bilkent.edu.tr/~korpe

CS342 Operating Systems 1 İbrahim Körpeoğlu, Bilkent University

 References

• The slides here are adapted/modified from the textbook and its slides:
Operating System Concepts, Silberschatz et al., 7th & 8th editions,
Wiley.

REFERENCES
• Operating System Concepts, 7th and 8th editions, Silberschatz et al.
Wiley.
• Modern Operating Systems, Andrew S. Tanenbaum, 3rd edition, 2009.

CS342 Operating Systems 2 İbrahim Körpeoğlu, Bilkent University

 Outline

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

CS342 Operating Systems 3 İbrahim Körpeoğlu, Bilkent University

 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 CPU-scheduling algorithm
for a particular system

CS342 Operating Systems 4 İbrahim Körpeoğlu, Bilkent University

 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

CS342 Operating Systems 5 İbrahim Körpeoğlu, Bilkent University

 Alternating Sequence of CPU and I/O
Bursts

CS342 Operating Systems 6 İbrahim Körpeoğlu, Bilkent University

 Histogram of CPU-burst Times

CS342 Operating Systems 7 İbrahim Körpeoğlu, Bilkent University

 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 under 1 and 4 is nonpreemptive
• All other scheduling is preemptive

CS342 Operating Systems 8 İbrahim Körpeoğlu, Bilkent University

 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

CS342 Operating Systems 9 İbrahim Körpeoğlu, Bilkent University

 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)

ready running

waiting

CS342 Operating Systems 10 İbrahim Körpeoğlu, Bilkent University

 Scheduling Algorithm Optimization
Criteria
• Maximize CPU utilization
• Maximize throughput
• Minimize turnaround time
• Minimize waiting time
• Minimize response time

CS342 Operating Systems 11 İbrahim Körpeoğlu, Bilkent University

 First-Come, First-Served (FCFS)
Scheduling
Process Burst Time (ms)
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 ms

CS342 Operating Systems 12 İbrahim Körpeoğlu, Bilkent University

 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 ms
• Much better than previous case
• Convoy effect: short process behind long process

CS342 Operating Systems 13 İbrahim Körpeoğlu, Bilkent University

 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

CS342 Operating Systems 14 İbrahim Körpeoğlu, Bilkent University

 Example of SJF

Process Arrival Time Burst Time

P1 0.0 6
P2 0.0 8
P3 0.0 7
P4 0.0 3
• SJF scheduling chart

P4 P1 P3 P2

0 3 9 16 24

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

CS342 Operating Systems 15 İbrahim Körpeoğlu, Bilkent University

 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 .

CS342 Operating Systems 16 İbrahim Körpeoğlu, Bilkent University

 Prediction of the Length of the Next CPU
Burst

CS342 Operating Systems 17 İbrahim Körpeoğlu, Bilkent University

 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

CS342 Operating Systems 18 İbrahim Körpeoğlu, Bilkent University

 Shortest Remaining Job First (SRJF)

• Preemptive version of SJF

• While a job A is running, if a new job B comes whose length is shorter

than the remaining time of job A, then B preempts A and B is started to
run.

CS342 Operating Systems 19 İbrahim Körpeoğlu, Bilkent University

 Shortest Remaining Job First (SRJF)

Process Arrival Time Burst Time

P1 0.0 8
P2 1.0 4
P3 2.0 9
P4 3.0 5
• SJF scheduling chart
P1 P2 P4 P1 P3

0 1 5 10 17 26

• Average waiting time = (9 + 0 + 2 + 15) / 4 = 6.5 ms

CS342 Operating Systems 20 İbrahim Körpeoğlu, Bilkent University

 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 (higher priority process preempts the running one)
– 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

CS342 Operating Systems 21 İbrahim Körpeoğlu, Bilkent University

 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  FIFO
– q small  q must be large with respect to context switch, otherwise
overhead is too high

CS342 Operating Systems 22 İbrahim Körpeoğlu, Bilkent University

 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

CS342 Operating Systems 23 İbrahim Körpeoğlu, Bilkent University

 Time Quantum and Context Switch Time

CS342 Operating Systems 24 İbrahim Körpeoğlu, Bilkent University

 Turnaround Time Varies With The Time
Quantum

CS342 Operating Systems 25 İbrahim Körpeoğlu, Bilkent University

 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 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

CS342 Operating Systems 26 İbrahim Körpeoğlu, Bilkent University

 Multilevel Queue Scheduling

CS342 Operating Systems 27 İbrahim Körpeoğlu, Bilkent University

 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

CS342 Operating Systems 28 İbrahim Körpeoğlu, Bilkent University

 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 RR (q=8). 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 RR and receives 16 additional
milliseconds. If it still does not complete, it is preempted and
moved to queue Q2.

CS342 Operating Systems 29 İbrahim Körpeoğlu, Bilkent University

 Multilevel Feedback Queues

CS342 Operating Systems 30 İbrahim Körpeoğlu, Bilkent University

 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

CS342 Operating Systems 31 İbrahim Körpeoğlu, Bilkent University

 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.

CS342 Operating Systems 32 İbrahim Körpeoğlu, Bilkent University

 Pthread Scheduling API

#include <pthread.h>
#include <stdio.h> This means kernel
#define NUM THREADS 5 will create threads and
int main(int argc, char *argv[]) will do scheduling
{ Treat it as a
int i; normal process
pthread t tid[NUM THREADS]; (not real-time, etc.)
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);
/* create the threads */
for (i = 0; i < NUM THREADS; i++)
pthread create(&tid[i],&attr,runner,NULL);
CS342 Operating Systems 33 İbrahim Körpeoğlu, Bilkent University
 Pthread Scheduling API

/* 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);
}

CS342 Operating Systems 34 İbrahim Körpeoğlu, Bilkent University

 Multiple-Processor Scheduling

• CPU scheduling more complex when multiple CPUs are available

• Homogeneous processors within a multiprocessor
• 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

CS342 Operating Systems 35 İbrahim Körpeoğlu, Bilkent University

 NUMA and CPU Scheduling

CS342 Operating Systems 36 İbrahim Körpeoğlu, Bilkent University

 Multicore Processors

• Recent trend to place multiple processor cores on same physical chip

• Faster and consume less power
• Multiple threads per core also growing
– Takes advantage of memory stall to make progress on another
thread while memory retrieve happens

CS342 Operating Systems 37 İbrahim Körpeoğlu, Bilkent University

 Multithreaded Multicore System

CS342 Operating Systems 38 İbrahim Körpeoğlu, Bilkent University

 Operating System Examples

• Solaris scheduling
• Windows XP scheduling
• Linux scheduling

CS342 Operating Systems 39 İbrahim Körpeoğlu, Bilkent University

 Solaris Dispatch Table

CS342 Operating Systems 40 İbrahim Körpeoğlu, Bilkent University

 Solaris Scheduling

CS342 Operating Systems 41 İbrahim Körpeoğlu, Bilkent University

 Windows XP Priorities

CS342 Operating Systems 42 İbrahim Körpeoğlu, Bilkent University

 Linux Scheduling

• Constant order O(1) scheduling time

• Two priority ranges: time-sharing and real-time
• Real-time range from 0 to 99 and nice value from 100 to 140
• (figure 5.15)

CS342 Operating Systems 43 İbrahim Körpeoğlu, Bilkent University

 Priorities and Time-slice length

CS342 Operating Systems 44 İbrahim Körpeoğlu, Bilkent University

 List of Tasks Indexed According to
Priorities

CS342 Operating Systems 45 İbrahim Körpeoğlu, Bilkent University

 Algorithm Evaluation

• Deterministic modeling – takes a particular predetermined workload

and defines the performance of each algorithm for that workload
• Queueing models
• Implementation

CS342 Operating Systems 46 İbrahim Körpeoğlu, Bilkent University

 Evaluation of CPU schedulers by
Simulation

CS342 Operating Systems 47 İbrahim Körpeoğlu, Bilkent University

 End of lecture

CS342 Operating Systems 48 İbrahim Körpeoğlu, Bilkent University