Q43,Paper3,D12. Consider n processes sharing the CPU in 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 – ns)/(n – 1)

(B) q >=(t – ns)/(n – 1)

(C) q <=(t – ns)/(n + 1)

(D) q >=(t – ns)/(n + 1)

Answer(B).