Scheduling  Algorithms  Review  

Strategy   Description   Advantages   Disadvantages  
FCFS   First Come, First Served   Simple -Average wait time may become very
high as short jobs may wait behind
long jobs.

-May lead to poor overlap of I/O and

CPU, since CPU-bound processes will
force I/O bound processes to wait for
the CPU, leaving the I/O devices idle.
Round Robin   Use a time slice and preemption Fair: each job gets an equal shot Average waiting time can be bad.
to alternate jobs   at the CPU
SJF/SRJF Shortest Job First -Provably optimal with respect to -Impossible to predict the amount of
minimizing the average waiting CPU time a job has left.
time
-Long running CPU bound jobs can
-Preemptive SJF is called SRTF - starve.
shortest remaining time first
MLFQ Multiple queues with different -Use past behavior to predict the Still confront the problem of fairness.
priorities. future and assign job priorities;
the scheme is adaptive.
Round Robin scheduling at each
level, running the jobs in -Approximates SJF.
highest priority queue first.

Round robin time slice increases

exponentially at lower priorities.

Priority of jobs can be changed.

Lottery -Give every job some number of -Avoid starvation Adding or deleting a job affects all
Scheduling lottery tickets; a winning ticket jobs proportionately, independent of
is randomly picked. -Can approximate SJF the number of tickets a job has.

-Give the most to short running

jobs, and fewer to long running
jobs (approximating SJF).

-To avoid starvation, every job

gets at least one ticket.