The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

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

  1. Step I:saving the context of $P_{old}$;
  2. Step II: running the scheduling algorithm to pick $P_{new}$;
  3. 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 $nT_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$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, . . . , P_k;$ each process requires exactly one CPU burst of $20$ms and no I/O burst.

asked in Operating System by Boss (40.4k points) | 25 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,532 questions
54,126 answers
71,046 users