454 views
1 votes
1 votes

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.

 

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Na462 asked Jul 12, 2018
1,169 views
0 votes
0 votes
2 answers
3
Purple asked Jan 13, 2017
801 views
Calculate the Exponential averaging for the $\text{SJF}$ with $T_{1}=10,\alpha = 0.5$ and previous runs as $8,7,4,16$$\text{(Give the answer correct to one decimal place)...