Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guarant...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.22/3729 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3729 |