A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 suchdoi:10.1109/rtcsa.2007.31 dblp:conf/rtcsa/AnderssonT07 fatcat:26bw2hn26vek7pr4ymeminf7jq