Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors
Data(s) |
18/02/2014
18/02/2014
2007
|
---|---|
Resumo |
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 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. |
Identificador |
DOI 10.1109/RTCSA.2007.31 978-0-7695-2975-2 1533-2306 |
Idioma(s) |
eng |
Publicador |
IEEE |
Relação |
Embedded and Real-Time Computing Systems and Applications; http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4296843 |
Direitos |
closedAccess |
Tipo |
article |