通过在数据中心分配工作负载来节省冷却和计算能力

Ruihong Lin, Yuhui Deng, Liyao Yang
{"title":"通过在数据中心分配工作负载来节省冷却和计算能力","authors":"Ruihong Lin, Yuhui Deng, Liyao Yang","doi":"10.1145/2903150.2903177","DOIUrl":null,"url":null,"abstract":"Reducing the power consumption has become one of the most important challenges in designing modern data centers due to the explosive growth of data. The traditional approaches employed to decrease the power consumption normally do not consider the power of IT devices and the power of cooling system simultaneously. In contrast to existing works, this paper proposes a power model which can minimize the overall power consumption of data centers by balancing the computing power and cooling power. Furthermore, an Enhanced Genetic Algorithm (EGA) is designed to explore the solution space of the power model since the model is a linear programming problem. However, EGA is computing intensive and the performance gradually decreases with the growth of the problem size. Therefore, Heuristic Greedy Sequence (HGS) is proposed to simplify the calculation by leveraging the nature of greed. In contrast to EGA, HGS can determine the workload allocation of a specific data center layout with only one calculation. Experimental results demonstrate that both the EGA and HGS can significantly reduce the power consumption of data centers in contrast to the random algorithm. Additionally, HGS significantly outperforms that of EGA.","PeriodicalId":226569,"journal":{"name":"Proceedings of the ACM International Conference on Computing Frontiers","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Conserving cooling and computing power by distributing workloads in data centers\",\"authors\":\"Ruihong Lin, Yuhui Deng, Liyao Yang\",\"doi\":\"10.1145/2903150.2903177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reducing the power consumption has become one of the most important challenges in designing modern data centers due to the explosive growth of data. The traditional approaches employed to decrease the power consumption normally do not consider the power of IT devices and the power of cooling system simultaneously. In contrast to existing works, this paper proposes a power model which can minimize the overall power consumption of data centers by balancing the computing power and cooling power. Furthermore, an Enhanced Genetic Algorithm (EGA) is designed to explore the solution space of the power model since the model is a linear programming problem. However, EGA is computing intensive and the performance gradually decreases with the growth of the problem size. Therefore, Heuristic Greedy Sequence (HGS) is proposed to simplify the calculation by leveraging the nature of greed. In contrast to EGA, HGS can determine the workload allocation of a specific data center layout with only one calculation. Experimental results demonstrate that both the EGA and HGS can significantly reduce the power consumption of data centers in contrast to the random algorithm. Additionally, HGS significantly outperforms that of EGA.\",\"PeriodicalId\":226569,\"journal\":{\"name\":\"Proceedings of the ACM International Conference on Computing Frontiers\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ACM International Conference on Computing Frontiers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2903150.2903177\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM International Conference on Computing Frontiers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2903150.2903177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

由于数据的爆炸性增长,降低功耗已成为现代数据中心设计中最重要的挑战之一。传统的降低能耗的方法通常不会同时考虑IT设备的功耗和冷却系统的功耗。在现有工作的基础上,本文提出了一种能量模型,通过平衡计算能力和冷却能力,使数据中心的整体能量消耗最小化。此外,由于幂模型是一个线性规划问题,设计了一种增强遗传算法(EGA)来探索幂模型的解空间。然而,EGA是计算密集型的,性能随着问题规模的增长而逐渐下降。因此,提出了启发式贪婪序列(HGS),利用贪婪的本质来简化计算。与EGA相比,HGS仅通过一次计算就可以确定特定数据中心布局的工作负载分配。实验结果表明,与随机算法相比,EGA和HGS都能显著降低数据中心的功耗。此外,HGS显著优于EGA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Conserving cooling and computing power by distributing workloads in data centers
Reducing the power consumption has become one of the most important challenges in designing modern data centers due to the explosive growth of data. The traditional approaches employed to decrease the power consumption normally do not consider the power of IT devices and the power of cooling system simultaneously. In contrast to existing works, this paper proposes a power model which can minimize the overall power consumption of data centers by balancing the computing power and cooling power. Furthermore, an Enhanced Genetic Algorithm (EGA) is designed to explore the solution space of the power model since the model is a linear programming problem. However, EGA is computing intensive and the performance gradually decreases with the growth of the problem size. Therefore, Heuristic Greedy Sequence (HGS) is proposed to simplify the calculation by leveraging the nature of greed. In contrast to EGA, HGS can determine the workload allocation of a specific data center layout with only one calculation. Experimental results demonstrate that both the EGA and HGS can significantly reduce the power consumption of data centers in contrast to the random algorithm. Additionally, HGS significantly outperforms that of EGA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信