This is the question I faced and couldn't solve it:
Five processes with computation times: x
, 5
, 8
, 6
, 10
request entering at t=0
.
Average waiting time is 20ms
. Find X
if we use FCFS
, SJF
, Round Robin (quantum=1ms)
I solved it with FCFS
and SJf -> x
is around 14
But how to solve with Round Robin?
Round Robin uses time slices and if we assume x > 10
(which seems to be) then the waiting time would be independent from the value of x.