Competitive analysis of partitioned scheduling on uniform multiprocessors
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10400.22/3967 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3967 |