{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:53:00Z","timestamp":1764251580871,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIA 1427584"],"award-info":[{"award-number":["IIA 1427584"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>A power-down system has an on-state, an off-state, and a finite or infinite number of intermediate states. In the off-state, the system uses no energy and in the on-state energy it is used fully. Intermediate states consume only some fraction of energy but switching back to the on-state comes at a cost. Previous work has mainly focused on asymptotic results for systems with a large number of states. In contrast, the authors study problems with a few states as well as systems with one continuous state. Such systems play a role in energy-efficiency for information technology but are especially important in the management of renewable energy. The authors analyze power-down problems in the framework of online competitive analysis as to obtain performance guarantees in the absence of reliable forecasting. In a discrete case, the authors give detailed results for the case of three and five states, which corresponds to a system with on-off states and three additional intermediate states \u201cpower save\u201d, \u201csuspend\u201d, and \u201chibernate\u201d. The authors use a novel balancing technique to obtain optimally competitive solutions. With this, the authors show that the overall best competitive ratio for three-state systems is     9 5     and the authors obtain optimal ratios for various five state systems. For the continuous case, the authors develop various strategies, namely linear, optimal-following, progressive and exponential. The authors show that the best competitive strategies are those that follow the offline schedule in an accelerated manner. Strategy \u201cprogressive\u201d consistently produces competitive ratios significantly better than 2.<\/jats:p>","DOI":"10.3390\/info10020044","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:27:52Z","timestamp":1548761272000},"page":"44","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems"],"prefix":"10.3390","volume":"10","author":[{"given":"James","family":"Andro-Vasko","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Nevada, Las Vegas, NV 89154, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7159-9880","authenticated-orcid":false,"given":"Wolfgang","family":"Bein","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Nevada, Las Vegas, NV 89154, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6975-0422","authenticated-orcid":false,"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[{"name":"School of Informatics and Engineering, The University of Electro-Communications, Tokyo 182-8585, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"ref_1","unstructured":"Latifi, S. (2016). Algorithmic Approaches for a Dependable Smart Grid. Information Technology: New Generations: 13th International Conference on Information Technology, Springer."},{"key":"ref_2","unstructured":"Agarwal, Y., Hodges, S., Chandra, R., Scott, J., Bahl, P., and Gupta, R. (2009, January 22\u201324). Somniloquy: Augmenting Network Interfaces to Reduce PC Energy Usage. Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, Boston, MA, USA."},{"key":"ref_3","unstructured":"Agarwal, Y., Savage, S., and Gupta, R. (2010, January 22\u201325). SleepServer: A Software-only Approach for Reducing the Energy Consumption of PCs Within Enterprise Environments. Proceedings of the 2010 USENIX Conference on USENIX Annual Technical Conference, Boston, MA, USA."},{"key":"ref_4","unstructured":"Nedevschi, S., Chandrashekar, J., Liu, J., Nordman, B., Ratnasamy, S., and Taft, N. (2009, January 22\u201324). Skilled in the Art of Being Idle: Reducing Energy Waste in Networked Systems. Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, Boston, MA, USA."},{"key":"ref_5","unstructured":"Reich, J., Goraczko, M., Kansal, A., and Padhye, J. (2010, January 22\u201325). Sleepless in Seattle No Longer. Proceedings of the 2010 USENIX Conference on USENIX Annual Technical Conference, Boston, MA, USA."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Pruhs, K. (2011, January 22\u201325). Green computing algorithmics. Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), Palm Springs, CA, USA.","DOI":"10.1109\/FOCS.2011.44"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/1095408.1095420","article-title":"The price of performance","volume":"3","author":"Barroso","year":"2005","journal-title":"ACM Queue"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/1735223.1735245","article-title":"Energy-Efficient Algorithms","volume":"53","author":"Albers","year":"2010","journal-title":"Commun. ACM"},{"key":"ref_9","unstructured":"Augustine, J., Irani, S., and Swamy, C. (2004, January 17\u201319). Optimal Power-Down Strategies. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1137\/05063787X","article-title":"Optimal Power-Down Strategies","volume":"37","author":"Augustine","year":"2008","journal-title":"SIAM J. Comput."},{"key":"ref_11","unstructured":"Borodin, A., and El-Yaniv, R. (1998). Online Computation and Competitive Analysis, Cambridge University Press."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Hall, R., Erd\u00e9lyi, R., Hanna, E., Jones, J.M., and Scaife, A.A. (2014). Drivers of North Atlantic Polar Front jet stream variability. Int. J. Climatol.","DOI":"10.1002\/joc.4121"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1067309.1067324","article-title":"Algorithmic Problems in Power Management","volume":"36","author":"Irani","year":"2005","journal-title":"SIGACT News"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kenyon, C., and Randall, D. (2001, January 6\u20138). Dynamic TCP Acknowledgement and Other Stories About e\/(e-1). Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, Crete, Greece.","DOI":"10.1145\/380752.380845"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Andro-Vasko, J., Bein, W., Nyknahad, D., and Ito, H. (2015, January 13\u201315). Evaluation of Online Power-Down Algorithms. Proceedings of the 12th International Conference on Information Technology\u2014New Generations, Las Vegas, NV, USA.","DOI":"10.1109\/ITNG.2015.82"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Bein, W., Hatta, N., Hernandez-Cons, N., Ito, H., Kasahara, S., and Kawahara, J. (2011, January 8\u20139). An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. Proceedings of the 9th International Conference on Approximation and Online Algorithms, Saarbr\u00fccken, Germany.","DOI":"10.1007\/978-3-642-29116-6_4"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H.L., Lam, T.W., and Lee, K.L. (2008, January 7\u201311). Scheduling for speed bounded processors. Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Reykjavik, Iceland.","DOI":"10.1007\/978-3-540-70575-8_34"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H.L., Pruhs, K., and Katz, D. (2009, January 5\u201312). Improved bounds for speed scaling in devices obeying the cube-root rule. Proceedings of the 36th International Colloqium on Automata, Languages and Programming, Rhodes, Greece.","DOI":"10.1007\/978-3-642-02927-1_14"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3587","DOI":"10.1016\/j.tcs.2010.05.035","article-title":"Deadline scheduling and power management for speed bounded processors","volume":"411","author":"Han","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2015.06.014","article-title":"Online dynamic power management with hard real-time guarantees","volume":"595","author":"Chen","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Albers, S., and Antoniadis, A. (2012, January 17\u201319). Race to Idle: New Algorithms for Speed Scaling with a Sleep State. Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan.","DOI":"10.1137\/1.9781611973099.100"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., and Megow, N. Meeting Deadlines: How Much Speed Suffices? In Proceedings of the ICALP 2011, Zurich, Switzerland, 4\u20138 July 2011.","DOI":"10.1007\/978-3-642-22006-7_20"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Bein, W. (2018). Energy Saving in Data Centers. Electronics, 7.","DOI":"10.3390\/electronics7010005"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1109\/COMST.2015.2481183","article-title":"Data Center Energy Consumption Modeling: A Survey","volume":"18","author":"Dayarathna","year":"2016","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TII.2012.2219063","article-title":"Evaluating Combined Load Forecasting in Large Power Systems and Smart Grids","volume":"9","author":"Borges","year":"2013","journal-title":"IEEE Trans. Ind. Inform."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/2\/44\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:29:31Z","timestamp":1760185771000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/2\/44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":26,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,2]]}},"alternative-id":["info10020044"],"URL":"https:\/\/doi.org\/10.3390\/info10020044","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,1,29]]}}}