Energy-efficient computations on a group of clusters
https://doi.org/10.15514/ISPRAS-2012-23-26
Abstract
The problem of scheduling parallel tasks on a group of geographically distributed clusters optimizing energy-efficiency of computations is considered. Some scheduling algorithms are proposed and experimentally investigated. Methods for reducing the energy consumption of a uniform computer cluster due to flexible control strategies of the node states (waking them up or shutting down) and of the execution order of the awaiting tasks are considered. A software system developed in the Institute for System Programming of the Russian Academy of Sciences (ISP RAS) for the dynamic control of nodes in order to reduce the energy consumption is described. Several strategies for controlling the states of the nodes are proposed and investigated. Our simulation showed that when the average density of tasks is 0.5, the energy saving is about 10%. When the density of the flow of tasks decreases, the effect of using the proposed system drastically increases: when the average density is 0.3, the saving is 30%; when the average density is 0.2, the saving is 50%; and when the average density is 0.1, the saving is 70%.
About the Authors
D. A. Grushin
ISP RAS, Moscow
Russian Federation
Russian Federation
N. N. Kuzyurin
ISP RAS, Moscow
Russian Federation
Russian Federation
References
1. Ivannikov V. P., Grushin D. A., Kuzyurin N. N., Pospelov A. I., and Shokurov A. V. Software for Improving the Energy Efficiency of a Computer Cluster. Programming and Computer Software, November 2010, Volume 36, Issue 6, pp 327-336
2. Albers S. Algorithms for Energy Saving. Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. 2009. P. 173–186.
3. Albers S., Fujiwara H. Energy-Efficient Algorithms for Flow Time Minimization. Lecture Notes in Computer Science. 2006. V. 3884. P. 621–633.
4. Augustine J., Irani S., Swamy C., Optimal power-down strategies. SIAM Journal on Computing. 2008. V. 37. P. 1499–1516.
5. Irani S., Shukla S. K., Gupta R. Algorithms for power savings. ACM Transactions on Algorithms. 2007. V. 3.
6. Irani S., Pruhs. Algorithmic problems in power management. SIGACT News. 2005. V. 36, no. 2. P. 63–76.
7. Zhang, Chatha. Approximation algorithm for the temperature-aware scheduling problem. ICCAD ’07: Proceedings of the 2007 IEEE-ACM international conference on Computer-aided design. Piscataway, NJ, USA: IEEE Press, 2007. P. 281–288.
8. Karlin A., Manasse M., McGeoch L., Owicki S. Randomized competitive algorithms for nonuniform problems. ACM-SIAM Symposium on Discrete Algorithms. 1990. P. 301–309.
9. Top500 supercomputer sites. 2011. November. www.top500.org.
10. Energy price statistics. 2011. November. http://epp.eurostat.ec.europa.eu.
11. Jackson D., Snell Q., Clement M.. Core Algorithms of the Maui Scheduler.Job Scheduling Strategies for Parallel Processing. Ed. by D. Feitelson, L. Rudolph. Springer Berlin. Heidelberg, 2001. V. 2221 of Lecture Notes in Computer Science. P. 87–102.
12. Sverdlik Y. Microsoft gets wind power for Dublin data center. http://www.datacenterdynamics.com. 2011.
13. Van Heddeghem W., Vereeckena W., Collea D. et al. Distributed computing for carbon footprint reduction by exploiting low-footprint energy availability. Future Generation Computer Systems. 2012. V. 28. P. 405– 414.
Review
For citations:
Grushin D.A., Kuzyurin N.N. Energy-efficient computations on a group of clusters. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2012;23. (In Russ.) https://doi.org/10.15514/ISPRAS-2012-23-26
Email this article 