Optimal scheduling of independent tasks on heterogeneous computing systems

In this paper, the problem of optimal scheduling of independent tasks on heterogeneous computing systems is considered. Optimal scheduling algorithms which produce preemptive schedules with minimal completion times and non-preemptive schedules with minimal mean flow times are described. A bound on mean flow times also provides us with information concerning the relative merit of different multiprocessor systems.