448 views

2 Answers

3 votes
3 votes
In Shortest job First we have to schedule the job which have shortest job first.

For that purpose we must know the burst time of job to schedule but in real time system job can come anytime and we can,t predict their burst time.So,Burst time of processes cannot be known ahead.
0 votes
0 votes
Since burst time of any process cannot be known prior , shortest job first is not practically implemented but still there are two techniques by which the burst time can be predicted on the basis of their previous burst times.

The two techniques are 1. Simple averaging

                                       2.Exponential averaging.

And moreover, Shortest job first has advantages like 1.Maximum Throughput

                                                                                   2.Minimum Average Turn Around Time

                                                                                   3.Minimum Average Waiting Time.

Related questions

1 votes
1 votes
1 answer
2
0 votes
0 votes
0 answers
3
Rahul_Rathod_ asked Dec 21, 2018
740 views
test and set is used to implement Lock / Unlock to avoid BUSSY WAITING.above statement is true or false?
1 votes
1 votes
2 answers
4