Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
Ref: HURRAY-TR-070101 Publication Date: 26 to 27, Mar, 2007
Competitive Analysis of Partitioned Scheduling on Uniform MultiprocessorsRef: HURRAY-TR-070101 Publication Date: 26 to 27, Mar, 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. 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 three times faster.
15th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS'07).
Long Beach, U.S.A..
WOS ID: 000250109000014.
Record Date: 1, Jan, 2007
Short links for this page: www.cister.isep.pt/docs/10_1109_rtcsa_2007_31 www.cister.isep.pt/docs/000250109000014 www.cister.isep.pt/docs/hurray_tr_070101 www.cister.isep.pt/docs/312