Homework #5: Due Friday 10/26/00

Given a set of tasks, split into top and bottom halves. Find an analytical expression for all of the deadline constraints. Assume that all top halves are non-preemtable, and that the all bottom halves are preemtable by any top half. Assume also that the top halves are scheduled based on priority and that the bottom halves are scheduled by a round robin algorithm.

State any assumptions that are necessary for your expressions to hold.