Optimal sleep patterns for serving delay-tolerant jobs

ABSTRACT

Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where entering and leaving sleeping mode incurs an energy and a response time penalty. We seek to understand under what kind of system configuration and control method will sleep mode obtain a Pareto Optimal tradeoff between energy saving and average response time. We prove that the optimal "sleeping" policy has a simple hysteretic structure. Simulation results then show that this policy results in significant energy savings, especially for relatively delay insensitive applications and under low traffic load. However, we demonstrate that seeking the maximum energy saving presents another tradeoff: it drives up the peak temperature in the server, with potential reliability consequences.

References

1. F. Baccelli, S. Machiraju, D. Veitch and J. C. Bolot. The role of PASTA in network measurement. In ACM SIGCOMM, 2006.
2. N. Bansal, T. Kimbrel, K. Pruhs. Speed scalaing to manage energy and temperature. J. ACM 54(1), 2007.
3. L. A. Barroso and U. Hölzle. The Case for Energy-Proportional Computing. Computer. 40(12):33--37, 2007.
4. D. P. Bertsekas. Dynamic Programming and Optimal Control, volume 2. Athena Scientific, Belmont, MA, USA, 2007.
5. P. Bohrer, E. Elnozahy, T. Keller, M. Kistler, C. Lefurgy and R. Rajamony. The case for power management in web servers. In Power Aware Computing. January 2002.
6. J. C. Cardona Restrepo, C. G. Gruber and C. Mas Machuca. Energy Profile Aware Routing. In Proc. Green Communications Workshop in conjuction with IEEE ICC'09 (GreenComm09). Dresden, Germany, 2009.
7. L. Chiaraviglio, M. Mellia and F. Neri. Reducing Power Consumption in Backbone Networks. In Proc. 2009 IEEE Internat. Conf. on Communications (ICC 2009). Dresden, Germany, 2009.
8. A. K. Coşkun, T. S. Rosing, K. A. Whisnant and K. C. Gross. Static and dynamic temperatur-aware scheduling for multiprocessor SoCs. IEEE Trans. VLSI, 16(9):1127--1140, 2008.
9. X. Fan, W-D. Weber, and L. A. Barroso. Power Provisioning for a Warehouse-sized Computer. In Proceedings of the ACM International Symposium on Computer Achitecure. San Diego, CA, June 2007.
10. J. M. George, and J. M. Harrison. Dynamic Control of a Queue with Adjustable Service Rate.INFORMS Operations Research. 49(5):720--731, September--October 2001.
11. M. Gupta and S. Singh. Greening of the Internet. In ACM SIGCOMM. Karlsruhe, Germany, August 2003.
12. M. Hersh and I Brosh. The optimal strategy structure of an intermitently operating service channel. European Journal of the Operational Research Society. 5:133--141, 1980.
13. D. P. Heyman Optimal operating policies for M/G/1 queueing systems Operations Research. 16:362--382, 1968.
14. S. K. Hipp, and U. D. Holzbaur. Decision Processes with Monotone Hysteretic Policies. Operations Research. 36(4):585--588, July--August 1988.
15. H. Kim and G. de Veciana. Leveraging dynamic spare capacity in wireless systems to conserve mobile terminals energy. to appear in IEEE/ACM Trans. Networking.
16. M. Kodialam, T. V. Lakshman and S. Sengupta. Traffic-oblivious routing for guaranteed bandwidth performance. IEEE Comm. Mag., pages 46--51. 2007.
17. S. Nedevschi, L. Popa, G. Iannaccone, S. Ratnasamy and D. Wetherall. Reducing Network Consumption via Sleeping and Rate-Adaptation. 2007.
18. F. V. Lu and R. F. Serfozo. M/M/1 Queueing Decision Processes with Monotone Hysteretic Optimal Policies. In Operations Research. 32(5), September--October 1984.
19. J. Mogul. Improving energy efficiency for networked applications. In Architectures for Networking and Communications Systems (ANCS). 2007
20. D. Meisner, B. T. Gold and T. F. Wenisch. PowerNap: eliminating server idle power. In ASPLOS '09: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems, pages 205--216. 2009.
21. K. Pruhs, P. Uthaisombut and G. Woeginger. Getting the best response for your erg. In Scandinavian Worksh. Alg. Theory. 2004
22. N. Vasic and D. Kostic. Energy-Aware Traffic Engineering. In EPFL Technical Report NSL-REPORT-2008-004. 2008.
23. A. Wierman, L. Andrew and A. Tang. Power-Aware Speed Scaling in Processor Sharing Systems. In Proc. IEEE INFOCOM. April 2009.
24. R. W. Wolff. Poisson arrivals see time averages. Operations Research. 30(2):223--231, 1982.
25. M. Yadin and P. Naor. Queueing systems with a removalbe service station. Operations Research, 14(4):393--405, 1963.
26. F. Yao, A. Demers and S. Shenker. A scheduling model for reduced CPU energy. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), pages 374--382. 1995.
27. M. Yu, Y. Yi and J. Rexford and M. Chiang. Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SIGCOMM Computer Communications Review. 38(2):19--29, 2008.
28. B. Zhai, D. Blaauw, D. Sylvester and K. Flautner. Theoretical and practical limits of dynamic voltage scaling. In DAC. 2004.
29. Z. G. Zhang, E. Love and Y. Song. The optimal service time allocation of a versatile server to queue jobs and stochastically available non-queue jobs of different types. Computers and Operations Research. 34(6):1857--1870, 2007.

Index Terms

• Computing methodologies

  • Modeling and simulation

    • Model development and analysis

      • Modeling methodologies

• General and reference

  • Cross-computing tools and techniques

    • Performance