![]() In the SRTF scheduling algorithm, the execution of any process can be stopped after a certain amount of time. However, the SRTF algorithm involves more overheads than the Shortest job first (SJF)scheduling, because in SRTF OS is required frequently in order to monitor the CPU time of the jobs in the READY queue and to perform context switching. So basically in SRTF, the processes are scheduled according to the shortest remaining time. ![]() With the help of the SRTF algorithm, the process having the smallest amount of time remaining until completion is selected first to execute. The Preemptive version of Shortest Job First(SJF) scheduling is known as Shortest Remaining Time First (SRTF). ![]()
0 Comments
Leave a Reply. |