University of Pacific
The authors present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, they provide a tight analysis of the algorithm's competitiveness. Their results generalize and improve upon work by the researchers, which considers a single speed scalable processor. Using significantly different techniques, they can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for their algorithm. In their scheduling problem, jobs arrive over time and are preemptable. They have different workloads, values, and deadlines.