Let's understand this with the help of an example. As it is a preemptive type of schedule, it is claimed to be better than SJF scheduling Algorithm. The process which has the least processing time remaining is executed first. SRTF, Which Stands for Shortest Remaining Time First is a scheduling algorithm used in Operating Systems, which can also be called as the preemptive version of the SJF scheduling algorithm. Submitted by Monika Sharma, on June 23, 2019 We will first define it briefly and will then illustrate it with the help of an example for understanding it better. Shortest Remaining Time First Scheduling Algorithm. In this article, we are going to study about the SRTF, i.e. This article is about the SRTF Scheduling Algorithm in Operating System.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
December 2022
Categories |