Introduction About SJF Algorithm
- It is a Non pre-emptive algorithm.
- It is implemanted on the basis of Burst Time(BT).
- A process which have least BT gets CPU first.
Advantage of SJF Algorithm
- It gives a maximum Throughput.
- Note : Here Throughput is number of tasks per unit time.
- It gives a minimum Average waiting Time and Turn Around Time.
Disadvantage of SJF Algorithm
- It may suffer with the problem of starvation.
- It is not implementable because Burst time of a process can not be known in advance.