Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors

Bjorn Andersson, Eduardo Tovar
2007 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 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
more » ... ntees are previously known for partitioned static-priority scheduling on uniform multiprocessors.. Abstract 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 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.
doi:10.1109/rtcsa.2007.31 dblp:conf/rtcsa/AnderssonT07 fatcat:26bw2hn26vek7pr4ymeminf7jq