Implementing slot-based task-splitting multiprocessor scheduling
Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or mor...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.22/3810 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3810 |