Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

Andersson, Björn; Tovar, Eduardo

http://hdl.handle.net/10400.22/3950

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
COM_EduardoTovar_2007_CISTER.pdf		176.44 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Andersson, Björn

Tovar, Eduardo

Resumo(s)

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.

URI

http://hdl.handle.net/10400.22/3950

Editora

IEEE

DOI

10.1109/RTCSA.2007.31

Coleções

ISEP – CISTER – Comunicações em eventos científicos

Métricas Alternativas

Ver registo completo