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...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10400.22/3935 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3935 |