What is shortest job first scheduling of CPU?
Shortest Job First (SJF) is a non-preemptive scheduling algorithm, SJF is
also known as Short-Job Next (SJN) algorithm. This algorithm is faster than FCFS.
This algorithm associates with each process, the estimated processing or burst
time. This algorithm selects the process first that has the shortest burst time.
The processes whose estimated execution time is less, does not have to wait for
a long time in the ready queue. This scheduling algorithm reduces the average
waiting time for a given set of processes.
|
