operating system - Shortest job first job with preemption allowed Anamoly -


consider following scenario, , take preemptive shortest first job executing algorithm. sjf[1]

the problem here @ timeline (3), p2 has 1 burst time available, p4 available has 2 burst time, question why p2 not continuing execution, , why p4 starting?, diagram wrong or have misunderstood in way.

gantt chart has like:

enter image description here

average waiting time should [(0+11) + 0 + 4 + 9] /4 =6.


Comments

Popular posts from this blog

Lists in Python -

android - can not access to progress bar in an other activity -

html - Not able to access next element of an array javascript -