In: Computer Science
For Shortest-Job-Next (SJN) Scheduling,
Answer is as follows :
Shortest Job next is also known as Shortest job first means that the process which has less execution time will be execute first.
Answer for given terms :
Arrival Time : Arrival time is time when the process being arrive for execution in the list.
Completion Time : Completion Time defines at what time process gets completed.
Burst Time : Burst Tie defines that how much time need by process to execute.
Turnaround Time : Turnaround time is time taken by process for execution that includes burst time and waiting time.
Waiting Time : Waiting time defines that how much time process has to wait for it's execution.
So according to these the algorithm is more efficient that has less waiting time and fast too so that process don't has to wait to much.
Properties :
Starvation : It is problem for a process is postponed for indefinite time by the system. Suppose there is process P1 that has burst time for 10 min, and other process P2,P3... are coming in between which has less burst time than P1. So they get to execute first and P1 get halts for indefinite time. But problem can solved by using concept of Aging.
Aging : Aging used to avoid starvation by assigning priority to processes.
PROS and CONS :
PROS :
CONS :
if there is any query please ask in comments..