Using at most 20 minutes, answer the following questions about preemptive fixed-task priority scheduling a set of independent tasks τ₁, ..., τ_n on a single processor.

1. State the Critical Zone Theorem.










2. Give the recursive formula for computing the response time of a task.










3. Using the Response Time test, or a diagram of the simulated execution of the task set in the critical zone, show that task τ₃ in the task set below will always complete within its deadline.

   i	pi (period)	ei (wcet)	di
   1	5	2	5
   2	7	2	7
   3	12	2	10

© 2006 T. P. Baker. ($Id: quiz0406.html,v 1.1 2008/08/25 11:18:48 baker Exp baker $)