Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform
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 w...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | report |
| Idioma: | eng |
| Publicado em: |
2014
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.22/3748 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3748 |