Which scheduling problem is most likely to occur in Shortest Remaining Time…
2025
Which scheduling problem is most likely to occur in Shortest Remaining Time First (SRTF)?
- A.
Deadlock
- B.
Starvation
- C.
Context switching overhead is zero
- D.
Thrashing
Attempted by 111 students.
Show answer & explanation
Correct answer: B
SRTF is the preemptive version of Shortest Job First (SJF) scheduling. At any given millisecond, the CPU scheduler looks at the ready queue and picks the process that requires the absolute least amount of execution time to finish.If Process P1 is running and needs 10ms to finish, and a new Process P2 arrives needing only 2ms, the CPU immediately halts P1 (context switch) and schedulesP2.