Measurements of a certain system have shown that a process runs, on the
average, for time T before blocking for Input/Output. Process switch
requires time S which is overhead. For round robin scheduling with quantum
Q, give a formula for the cpu efficiency in each of the following cases:
(a) Q=infinity (b) Q>T (c) S<Q<T (d) Q=S (e) Q nearly 0
Efficiency is T/(T+S) cpu efficiency is useful cpu time/total cpu time, i.e. sum of cpu
useful time and cpu overhead in switching processes.
each run of T requires T/Q process switches, resulting
in overhead of ST/Q and therefore, the efficiency is T/(T+(ST/Q)) which is
Q/(Q+S).
from galvin If T=10 and Q=1 then there wil be 9 context switches i but i am not getting these above farmula how it came if i divide T\Q then it will be 10 please explain these thing
