A carregar...
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 499.16 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 two-type
heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1
processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We
present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an
optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr
also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first
result for resource sharing on heterogeneous platforms with provable performance.
Descrição
Palavras-chave
Heterogeneous multiprocessor systems Real-time scheduling Resource sharing