Q2.17

MCQMarks unknown

Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get its turn at the CPU at least every $t$ seconds?

(A)

$q \leq \frac{t-ns}{n-1}$

(B)

$q \geq \frac{t-ns}{n-1}$

(C)

$q \leq \frac{t-ns}{n+1}$

(D)

$q \geq \frac{t-ns}{n+1}$

Loading…