Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System

Abstract The problem to be addressed is one of scheduling multiprocessor tasks, some of which require more than one processor at a time. We extend this model by introducing a uniform k -processor system consisting of k -tuples of processors having the same speeds. A low order polynomial-time preemptive scheduling algorithms is proposed when schedule length is the performance measure.