cpu - Shortest Remaining Time Scheduling -


can results of shortest remaining time schedule same preemptive , non preemptive? like, can still same times @ end of both or impossible?

it not impossible.it depends on arrival time , burst time of processes.

for example:if have processes following arrival time , burst times.

p1 1,2

p2 2,4

p3 3,5

it gives same result,be preemptive or non preemptive.


Comments

Popular posts from this blog

javascript - how to protect a flash video from refresh? -

android - Associate same looper with different threads -

visual studio 2010 - Connect to informix database windows form application -