Bounds on the Scheduling of Types Task Systems
We study the scheduling of different types of tasks on different types of processors. If there are k types of tasks and mi identifical processors for takss of type I, the finishing times of any demand driven or list schedule is at most k+1-(1/mas(m1,…,mk)) times worse than the optimal schedule. This...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148939 |