Shortest Remaining Time First scheduling algorithm is Really Versatile Solution?
The shortest remaining time first is a scheduling algorithm of an operating system Shortest Remaining Time First (SRTF).
Shortest Remaining Time The First scheduling algorithm is mostly preemptive of SJF scheduling. In shortest time remaining time first scheduling algorithm the execution process stopped after some certain time immediately.
When all the process is done or in ready to queue to work, then It will not run like a preemptive, It is work as SJF scheduling algorithm. In the shortest remaining time, the first scheduling algorithm the process control block system feature is awesome and useful. because it is accessible to the next execution of the process.
Shortest Remaining Time First Scheduling Criteria
- The process that requires the shortest time to complete execution, is served first.
Shortest Remaining Time First Scheduling Decision Mode
- preemptive: When a new process arrives, its total time is compared to the current process remaining time.
If the new job needs less time to finish than the current process, the current process is suspended and the new job started.
Shortest Remaining Time First Scheduling Implementation
- This strategy can be easily implemented by using FIFO. FIFO means First In First Out.
- Firstly select that process which arrives and then completes it to the 1 unit of time after that
- Check for the shortest remaining time from the arrival process only.
- Similarly, All the processes get the execution.
- Firstly for Finding Completion time, looking in the Gantt chart from the back and complete of each process is completion time.
- Secondly, Turn Around Time = Completion Time – Arrival Time.
- Thirdly, Waiting Time = Turn Around Time – Burst Time.
Also Read –> Priority-Based Scheduling Algorithm
|Process||Arrival Time (A.T.)||Burst Time (B.T.)|
That is to say,
- Only one process is arriving at 0 time P0. so, we have to do the execution of process P0 for 1 unit time.
- After that First process is getting the executes the first-time check for the shortest remaining time of arrived processes.
- Similarly, All the processes execute likewise.
As a result, we get
|Process||Arrival Time||Burst Time||Completion Time||Turnaround Time||Waiting Time|
Average Turnaround Time:(22+8+2+8)/4 = 10.0
Average Waiting Time: (12+2+0+4)/4 = 4.5
- It is optimal and guarantees Less waiting time during programming.
- In the shortest remaining time first scheduling algorithm the Response time is less.
- It provides standard and It is better than other all algorithm and that’s why It called the versatile scheduling algorithm.
- We can’t predict the completion time of the process.
- Starvation is possible for a long process.
- Priority can’t be set for the processes.
- If processes have large burst time then It performs poor response time.
- It leads to starvation when It comes to the large burst time.
Comment for any query.
To learn more concept about SRTF go to
For Android projects goto the ANDROID
Stay Connect with our app
For Assignment Questions and Explanation of a theory topic visit:
Note for the visitor
Here easy engineering provides materials related to exams online by this blog. The main aim of the blog is to provide materials that are not able to buy books from the market. If you like our service then please kindly share it with your university students and other students who are not able to buy books.
Easyengneering.in provides material by collecting from different websites, so we are not the original publishers of books or materials. we are publishers of contents or posts which can help your carrier. for any quarries contact us on firstname.lastname@example.org. I hope you like this education blog and we are ready to help those students who really deserve to learn but they can’t afford the money.
Join our telegram group for daily updates of websites
Join our Facebook page for more details and daily updates