In previous post, we have discussed Set 1 of SJF i.e. non-preemptive. In this post we will discuss the preemptive version of SJF known as Shortest Remaining Time First (SRTF).
In this scheduling algorithm, the process with the smallest amount of time remaining until completion is selected to execute. Since the currently executing process is the one with the shortest amount of time remaining by definition, and since that time should only reduce as execution progresses, processes will always run until they complete or a new process is added that requires a smaller amount of time.
Preemptive SJF: Example
P1 waiting time: 4-2 = 2
P2 waiting time: 0
The average waiting time(AWT): (0 + 2) / 2 = 1
1- Short processes are handled very quickly.
2- The system also requires very little overhead since it only makes a decision when a process completes or a new process is added.
3- When a new process is added the algorithm only needs to compare the currently executing process with the new process, ignoring all other processes currently waiting to execute.
1- Like shortest job first, it has the potential for process starvation.
2- Long processes may be held off indefinitely if short processes are continually added.
Implementation: 1- Traverse until all process gets completely executed. a) Find process with minimum remaining time at every single time lap. b) Reduce its time by 1. c) Check if its remaining time becomes 0 d) Increment the counter of process completion. e) Completion time of current process = current_time +1; e) Calculate waiting time for each completed process. wt[i]= Completion time - arrival_time-burst_time f)Increment time lap by one. 2- Find turnaround time (waiting_time+burst_time).
Processes Burst time Waiting time Turn around time 1 6 3 9 2 8 16 24 3 7 8 15 4 3 0 3 Average waiting time = 6.75 Average turn around time = 12.75
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.