This paper considers a scheduling problem whose objective is to determine both the optimal speeds of processors and an optimal schedule in a preemptive multiprocessor environment. The jobs are independent and each processor can be assigned any speed; however, the cost associated with each processor is a function of the processor's speed. Polynomial algorithms are presented to find optimal speed assignments for a variety of cost functions.
['Hiroaki Ishii', 'Charles U. Martel', 'Teruo Masuda', 'Toshio Nishida']
A Generalized Uniform Processor System