Consider n processes sharing the CPU in a round-robin fashion. Assuming that…
GATE · 1998 · CS · Question 2 subparts
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 <= (t - n*s)/(n - 1)
- B.
q >= (t - n*s)/(n - 1)
- C.
q <= (t - n*s)/(n + 1)
- D.
q >= (t - n*s)/(n + 1)
Attempted by 474 students.
Sign up free to check your answer
Sign up freeLoading lesson…