Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2017/digital-systems-linear-algebra-introduction-to-formal-proof/2/d/solution

With the given ready-order rule and A first, the CPU timeline in milliseconds is
A performs input-output during and ; B does so during and . In particular, B becoming ready at time 7 does not interrupt A's ongoing nonpreemptive burst. The completion times are and , giving
There are 15 ms of useful CPU execution and 2 ms of idle time on this particular timeline.
Figure 1.
CPU timelines and I/O waits for the two scheduling policies
. Both processes arrive at zero. Readiness determines queue order; A wins initial ties. The displayed completion times give mean turnarounds 16.5 ms without preemption and 14 ms with a two-millisecond quantum. Details.

New to topics? Read the docs here!