Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
Ref: HURRAY-TR-061101 Publication Date: 1, Nov, 2006
Competitive Analysis of Partitioned Scheduling on Uniform MultiprocessorsRef: HURRAY-TR-061101 Publication Date: 1, Nov, 2006
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 Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other algorithm can schedule assuming that our algorithm is given processors that are two times faster.