Sporadic multiprocessor scheduling with few preemptions
Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration,...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10400.22/3936 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3936 |