Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
Ref: HURRAY-TR-070802 Publication Date: 21 to 24, Aug, 2007
Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform MultiprocessorsRef: HURRAY-TR-070802 Publication Date: 21 to 24, Aug, 2007
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. On each processor, tasks are scheduled with rate-monotonic. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are √2/(√2−1) ≈ 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.
13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'07), IEEE, pp 111-119.
Daegu, South Korea.
WOS ID: 000250109000014.