Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed i...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | report |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.22/3757 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3757 |