process - CPU scheduling algorithms and arrival time -


i looking @ examples found on website :

 http://www.tutorialspoint.com/operating_system/os_process_scheduling_algorithms.htm 

and there's doesn't make sense examples. take shortest-job-first example. premise take process least execution time , run first.

the example runs p1 first , p0. why? @ t = 0 process exists in queue p0. wouldn't start running @ t = 0, , p1 start @ t = 6?

i've got same issue priority based scheduling.

you right , since process p0 has arrived @ queue @ 0 sec , before p1 , start executing before p1 .

their answer correct if there no arrival time corresponding process , in case , considered processes have reached @ queue @ same time .so, process shortest executing time executed cpu first .


Comments

Popular posts from this blog

java - Plugin org.apache.maven.plugins:maven-install-plugin:2.4 or one of its dependencies could not be resolved -

Round ImageView Android -

How can I utilize Yahoo Weather API in android -