Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed S-p. Tasks can be preempted but they cannot migrate between processors. On each processor tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithin is given processors that are root 2/root 2-1 approximate to 3.41 timesfaster No such guarantees ore previously known for partitioned static-priority scheduling on uniform multiprocessors.