Operating System: Shortest Remaining Time First Algorithm Analysis

This assignment provides an overview of the Shortest Remaining Time First (SRTF) algorithm in operating systems. It begins with an introduction to the algorithm, explaining its preemptive nature and how it builds upon the Shortest Job First (SJF) algorithm. The assignment discusses the advantages of SRTF, such as its ability to quickly return short processes and optimize average response time. It also highlights the disadvantages, including the need for accurate burst time estimation and the potential for long jobs to be indefinitely postponed. The assignment concludes by emphasizing that the SRTF algorithm relies on the CPU burst time and is a preemptive version of the SJF algorithm. The assignment also includes references to the provided sources.

Operating System Working Principle of
Shortest Remaining Time First Algorithm
Introduction
Shortest Remaining
Time First Scheduling
is a pre-empted
version of SJF
(Shortest Job First). In
SJF, once a process
begins execution, it
runs until it is
completed. In SRTF A
successive process
can be pre-empted
by a process of user
with a minimal
estimated run time 1.
Advantages
• SRTF is a
scheduling
algorithm that
favours jobs that
can be done the
fastest
• Schedule shortest
ones first
• Optimize average
response time
• Probably optimal
with respect to
minimizing the
average waiting
time.
• The advantages of
SRTF is short
processes returns
quickly and it has
high yield2.
Disadvantage
s
• it must be possible
to accurately
estimate a job's
remaining time
and large jobs may
never get their
time share if many
small process is
continually added
• Practically it is not
possible to predict
the burst time3.
Conclusion
It
can be concluded
that the shortest
remaining time first
algorithm depends
on the CPU burst
time. It is the pre-
emptive version of
SJF. This algorithm
optimises the
average time.
• 1. OS SRTF scheduling Algorithm - javatpoint". in , ,
2018, <https://www.javatpoint.com/os-srtf-
scheduling-algorithm> [accessed 30 October 2018].
• 2. KAUR, P, "SRTF algorithm | Techtud.".
in Techtud.com, , 2018,
<https://www.techtud.com/example/srtf-algorithm-
0> [accessed 30 October 2018].
• 3. "SCHEDULING ALGORITHMS". in , , 2018,
<https://www.cl.cam.ac.uk/teaching/1617/OpSystem
s/pdf/05-Scheduling-Algorithms.pdf> [accessed 30
References