Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is ______ milliseconds.
The scheduler knows the burst lengths, and without preemption the best average waiting time comes from **Shortest Job First**: run 10, then 16, then 20.
Process (burst)
Start
Waiting time
10
0
0
16
10
10
20
26
26
Average waiting time $=\dfrac{0+10+26}{3}=\dfrac{36}3=\mathbf{12}$ ms.
More CPU and I/O Scheduling questions
GATE 2020 CS Q60– Consider the following set of processes, assumed to have arrived at time 0. Consider the…
GATE 2019 CS Q51– Consider the following four processes with arrival times (in milliseconds) and their…
GATE 2018 CS Q63– Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders…
GATE 2015 CS (CS1) Q52– Consider a uniprocessor system executing three tasks T 1, T 2 and T 3, each of which is…
GATE 2016 CS (CS1) Q30– Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted…
GATE 2017 CS (CS1) Q34– Consider the following CPU processes with arrival times (in milliseconds) and length of…