Scheduling independent two processor tasks on a uniform duo-processor system

AbstractThe 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 uniform duo-processor systems consisting of pairs of processors having the same speeds. A low order polynomial-time algorithm for preemptive scheduling of uni- and two-processor tasks is proposed, when schedule length is the performance measure