What is shortest remaining time first scheduling algorithm?
Answers
Answered by
0
Answer:
Shortest remaining time, also known as shortest remaining time first (SRTF), is a scheduling method that is a preemptive version of shortest job next scheduling. ... Like shortest job next, it has the potential for process starvation; long processes may be held off indefinitely if short processes are continually added.
Similar questions