Homework #2
Assigned 10/30, Due 11/6, Accepted until 11/8

1. Consider the following three VM CPU allocation schemes in terms of
efficiency (% CPU used) and covert channel bandwidth. Assume two processes,
at least one of which is always ready to run, such that the amount of work
that each process wants to do in a quanta is uniformly distributed between
0 and 10 ms. Assume a 0.1ms context switch time, and assume that a minimal
if (array[index]) yield(); test will take 0.1ms.

a. Pure round robin, no restrictions on clock accuracy.
b. As in (a), but with a minimum run time for each process of 2ms.
c. As in (b), but with random padding between processes uniform 
   between 0 and 5ms.
d. As in (b), but with clock granularity of 100ms.