Can anyone explain how the SJF approximation algorithm works?
I can see that it predicts the next CPU burst. But how exactly is it selecting a process with this predicted next CPU burst?
Preemption is not possible with SJF approximation, isn’t it?
here’s a screenshot from Galvin.