edited by
61 views
0 votes
0 votes

A context switch from a process $P_{old}$ to a process $P_{new }$ consists of the following steps: -

  • Step I: saving the context of $P_{old};$ 
  • Step II: running the scheduling algorithm to pick $P_{new};$ 
  • Step III: restoring the saved context of $P_{new}.$

Suppose Steps I and III together take $T_{0}$ units of time. The scheduling algorithm takes $n T_{1}$ units of time, where $n$ is the number of ready-to-run processes. The scheduling policy is round-robin with a time slice of $10 \mathrm{~ms}$. Compute the CPU utilization for the following scenario: $k$ processes become ready at almost the same instant in the order $P_{1}, P_{2}, \ldots, P_{k};$ each process requires exactly one $\mathrm{CPU}$ burst of $20 \mathrm{~ms}$ and no $\mathrm{I} / \mathrm{O}$ burst.

edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
0 answers
3
1 votes
1 votes
1 answer
4
admin asked Aug 8, 2022
381 views
Consider a stack machine where the only available workspace is a stack whose elements are unsigned integers. We will denote the configuration of the stack by a sequence. ...