Bounds on the Scheduling of Types Task Systems

Abstract

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 bound is best possible. If the processors execute at different speeds then the performance ratio of any list schedule (relative to the optimal schedule) is bounded by k plus the maximum ratio between the speeds of any two processors of the same type.