Abstract
The most commonly studied energy management technique is speed scaling, which involves operating the processor in a slow, energy-efficient mode at non-critical times, and in a fast, energy-inefficient mode at critical times. The natural resulting optimization problems involve scheduling jobs on a speed-scalable processor and have conflicting dual objectives of minimizing energy usage and minimizing waiting times. One can formulate many different optimization problems depending on how one models the processor (e.g., whether allowed speeds are discrete or continuous, and the nature of relationship between speed and power), the performance objective (e.g., whether jobs are of equal or unequal importance, and whether one is interested in minimizing waiting times of jobs or of work), and how one handles the dual objective (e.g., whether they are combined in a single objective, or whether one objective is transformed into a constraint). There are a handful of papers in the algorithmic literature that each give an efficient algorithm for a particular formulation. In contrast, the goal of this paper is to look at a reasonably full landscape of all the possible formulations. We give several general reductions which, in some sense, reduce the number of problems that are distinct in a complexity theoretic sense. We show that some of the problems, for which there are efficient algorithms for a fixed speed processor, turn out to be NP-hard. We give efficient algorithms for some of the other problems. Finally, we identify those problems that appear to not be resolvable by standard techniques or by the techniques that we develop in this paper for the other problems.
N. Barcelo—This material is based upon work supported by the National Science Foundation Graduate Research Fellowship under Grant No. DGE-1247842.
P. Kling—Supported by a fellowship within the Postdoc-Programme of the German Academic Exchange Service (DAAD). Work done while at the University of Pittsburgh.
K. Pruhs—Supported by NSF grants CCF-1115575, CNS-1253218, CCF-1421508, and an IBM Faculty Award.
M. Scquizzato—Work done while at the University of Pittsburgh.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In fact, a slightly more general result yields an optimal FE-IDUA schedule given an optimal completion ordering.
- 2.
Subdifferentials generalize the derivative of convex functions. \(\partial P(s)\) is the set of slopes of lines through (s, P(s)) that lower bound P. It is closed, convex on the interior of P’s domain, and non-decreasing if P is increasing [13].
References
Albers, S.: Energy-efficient algorithms. Commun. of the ACM 53(5), 86–96 (2010)
Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms 3(4) (2007)
Andrew, L.L.H., Wierman, A., Tang, A.: Optimal speed scaling under arbitrary power functions. SIGMETRICS Perform. Eval. Rev. 37(2), 39–41 (2009)
Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K., Scquizzato, M.: Efficient computation of optimal energy and fractional weighted flow trade-off schedules. In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 63–74 (2014)
Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: Scheduling for speed bounded processors. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 409–420. Springer, Heidelberg (2008)
Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. SIAM J. Comput. 39(4), 1294–1308 (2009)
Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. ACM Trans. Algorithms 9(2), 18:1–18:14 (2013)
Baptiste, P.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Sched. 2(6), 245–252 (1999)
Baptiste, P.: Scheduling equal-length jobs on identical parallel machines. Discrete Appl. Math. 103(1–3), 21–32 (2000)
Barcelo, N., Cole, D., Letsios, D., Nugent, M., Pruhs, K.: Optimal energy trade-off schedules. Sustainable Comput.: Inform. Syst. 3, 207–217 (2013)
Chan, S.-H., Lam, T.-W., Lee, L.-K.: Non-clairvoyant speed scaling for weighted flow time. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 23–35. Springer, Heidelberg (2010)
Devanur, N.R., Huang, Z.: Primal dual gives almost optimal energy efficient online algorithms. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1123–1140 (2014)
Hiriart-Urruty, J.-B., Lemaréchal, C.: Fundamentals of Convex Analysis. Springer, Heidelberg (2001)
Labetoulle, J., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Preemptive scheduling of uniform machines subject to release dates. In: P.H.R. (eds.) Progress in Combinatorial Optimization, pp. 245–261. Academic Press (1984)
Lam, T.-W., Lee, L.-K., To, I.K.K., Wong, P.W.H.: Speed scaling functions for flow time scheduling based on active job count. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 647–659. Springer, Heidelberg (2008)
Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 745–756. Springer, Heidelberg (2013)
Pruhs, K., Uthaisombut, P., Woeginger, G.J.: Getting the best response for your erg. ACM Trans. Algorithms 4(3) (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barcelo, N., Kling, P., Nugent, M., Pruhs, K., Scquizzato, M. (2015). On the Complexity of Speed Scaling. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48054-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-48054-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48053-3
Online ISBN: 978-3-662-48054-0
eBook Packages: Computer ScienceComputer Science (R0)