Suppose that a scheduler has k ready processes at time 0, and that no new processes are created after time 0. Process i (0 < i <= k) requires i units of computing time. For a preemptive, round-robin scheduler with a scheduling quantum of one time unit, what is the mean response time for these processes? For a non-preemptive, shortest-job-first scheduler, what is the mean response time for these processes? (If you have trouble doing this for arbitrary k, try it for a small fixed value of k, such as k = 3.) If one of these schedulers has a lower mean response time than the other, does that mean that it is a better scheduler? Why or why not?
2006-06-09
21:38:17
·
1 answers
·
asked by
lonely 4 ever
2