Loading...

Scheduling to minimize gaps and power consumption

Demaine, E. D ; Sharif University of Technology | 2013

680 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s10951-012-0309-6
  3. Publisher: 2013
  4. Abstract:
  5. 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(√n) -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 n-approximation for maximizing throughput given a hard upper bound on the number of gaps
  6. Keywords:
  7. Approximation results ; Computation time ; Multi processor systems ; Polynomial-time algorithms ; Scheduling problem ; Scheduling tasks ; Total power consumption ; Unit intervals ; Algorithms ; Cost accounting ; Scheduling
  8. Source: Journal of Scheduling ; Volume 16, Issue 2 , April , 2013 , Pages 151-160 ; 10946136 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs10951-012-0309-6