Dynamic power management algorithms in maximizing net profit

In this paper, we study energy management algorithms for job scheduling. In our model, each job has a release time, a processing time, a reward, and a deadline. The objective is to maximize net profit, defined as the difference between the total reward achieved by completing jobs by their deadlines and the total energy consumption accrued during this course. The net profit model generalizes the well-studied minimum-energy model (Irani and Pruhs, ACM SIGACT News 2005, Baptiste et al. ESA 2007). For the net profit model, we discuss the hardness of the general case and design polynomial-time algorithms for a few important variants.

[1]  Fei Li,et al.  Scheduling weighted packets with deadlines over a fading channel , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Marek Chrobak,et al.  Polynomial-time algorithms for minimum energy scheduling , 2009, TALG.

[4]  Sandy Irani,et al.  An overview of the competitive and adversarial approaches to designing dynamic power management strategies , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[5]  Rami G. Melhem,et al.  Maximizing rewards for real-time applications with energy constraints , 2003, TECS.

[6]  Fei Li,et al.  Competitive Analysis of Energy-Constrained Real-Time Scheduling , 2009, 2009 21st Euromicro Conference on Real-Time Systems.

[7]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[8]  Sandy Irani,et al.  Algorithmic problems in power management , 2005, SIGA.

[9]  Fei Li,et al.  An optimal online algorithm for packet scheduling with agreeable deadlines , 2005, SODA '05.