A Generalized Uniform Processor System
Hiroaki Ishii, Charles Martel, Teruo Masuda, Toshio Nishida
Operations Research · 1985 · Volume 33 · Issue 2
Abstract
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.
Keywords
584 optimal speeds of uniform processors, 657 quadratic speed costs of uniform processors
Enable JavaScript for citation tools and additional paper interactions.