Scheduling to minimize gaps and power consumption
Author(s)Demaine, Erik D.; Ghodsi, Mohammad; Hajiaghayi, Mohammad Taghi; Sayedi-Roshkhar, Amin S.; Zadimoghaddam, Morteza
MetadataShow full item record
This paper considers scheduling tasks while minimizing the power consumption of one or more processors, each of which can go to sleep at a fixed cost α . There are two natural versions of this problem, both considered extensively in recent work: minimize the total power consumption (including computation time), or minimize the number of “gaps” in execution. For both versions in a multiprocessor system, we develop a polynomial-time algorithm based on sophisticated dynamic programming. In a generalization of the power-saving problem, where each task can execute in any of a specified set of time intervals, we develop a (1+23α) -approximation, and show that dependence on α is necessary. In contrast, the analogous multi-interval gap scheduling problem is set-cover hard (and thus not o(lgn) -approximable), even in the special cases of just two intervals per job or just three unit intervals per job. We also prove several other hardness-of-approximation results. Finally, we give an O(n√) -approximation for maximizing throughput given a hard upper bound on the number of gaps.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal of Scheduling
Springer-Verlag Berlin Heidelberg
Demaine, Erik D., Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, and Morteza Zadimoghaddam. “Scheduling to Minimize Gaps and Power Consumption.” Journal of Scheduling 16, no. 2 (April 2013): 151–160.
Author's final manuscript