如何在SJF(NON-preemptive)调度中找到完成时间？

Question

有人能帮我吗?我试过这个问题，但我不清楚这个概念，这是操作系统中的sjf非抢占式算法。有没有人能检查一下这是对还是错？我在提前等reply...thanks ..

​

p   AT  BT  CT
P1  0   5   5
P2  2   3   11
P3  4   2   8
P4  6   4   15
P5  7   1   6

​

Answer 1

请参阅此链接http://javahungry.blogspot.com/2013/11/shortest-remaining-time-first-srt-preemptive-non-preemptive-sjf-scheduling-algorithm-with-example-java-program-code.html

Ans: P1 -> P3 -> P5 -> P2 -> P4
CT:  05 -> 07 -> 08 -> 11 -> 15 (Based on chart)

根据上面的链接，你可以找到CT。

其他链接：https://www.youtube.com/watch?v=LNsHRY5Nk5U

http://perugini.cps.udayton.edu/teaching/courses/cps346/lecture_notes/scheduling.html