Menu
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. In this scheduling algorithm, the process with the smallest amount of time remaining until completion is selected to execute. In this post we will discuss the preemptive version of SJF known as Shortest Remaining Time First (SRTF). ![]() ![]() In previous post, we have discussed Set 1 of SJF i.e.
0 Comments
Leave a Reply. |