A carregar...
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 266.51 KB | Adobe PDF |
Orientador(es)
Resumo(s)
Consider the problem of scheduling a set of
implicit-deadline sporadic tasks to meet all deadlines on
a heterogeneous multiprocessor platform. We consider a
restricted case where the maximum utilization of any task on
any processor in the system is no greater than one. We use
an algorithm proposed in [1] (we refer to it as LP-EE) from
state-of-the-art for assigning tasks to heterogeneous multiprocessor
platform and (re-)prove its performance guarantee
for this restricted case but for a stronger adversary. We show
that if a task set can be scheduled to meet deadlines on a
heterogeneous multiprocessor platform by an optimal task
assignment scheme that allows task migrations then LP-EE
meets deadlines as well with no migrations if given processors
twice as fast.
Descrição
Palavras-chave
Heterogeneous multiprocessor Task migrations Real-time scheduling