Scheduling arbitrary-deadline sporadic task systems on multiprocessors
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted. This algorithm is based on a task-splitting approach - while most tasks are entirely assigned to specific processors, a few tasks (f...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2014
|
| Texto completo: | http://hdl.handle.net/10400.22/3935 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3935 |