云計算數(shù)據(jù)中心活躍服務(wù)器最優(yōu)配置算法
發(fā)布時間:2018-08-15 14:57
【摘要】:云計算數(shù)據(jù)中心由通過高速網(wǎng)絡(luò)連接的大量服務(wù)器構(gòu)成,一種有效的節(jié)能措施是維持與系統(tǒng)負(fù)載成比例的活躍服務(wù)器數(shù)量同時切換剩余服務(wù)器到空閑模式,由此分別產(chǎn)生了操作能耗和切換能耗.研究在不同服務(wù)時隙內(nèi)負(fù)載已知情況下,如何配置活躍服務(wù)器數(shù)量以最小化數(shù)據(jù)中心能耗的問題.首先,建立了問題的NP數(shù)學(xué)模型;然后分析了無切換能耗情況下最優(yōu)解的特性;最終通過消除整數(shù)動態(tài)規(guī)劃的遞推過程,得到具有多項式復(fù)雜度的最優(yōu)算法.數(shù)值結(jié)果表明,最優(yōu)算法在不同負(fù)載變化趨勢下保證能耗達(dá)到最小的同時保證計算過程平穩(wěn).
[Abstract]:Cloud computing data centers are made up of a large number of servers connected by high-speed networks. An effective energy saving measure is to maintain the number of active servers in proportion to the system load and switch the remaining servers to idle mode. Thus, the operation energy consumption and the switching energy consumption are generated respectively. In this paper, the problem of how to configure the number of active servers to minimize the energy consumption of data centers under the condition that the load in different service slots is known is studied. First, the NP mathematical model of the problem is established, then the characteristics of the optimal solution without switching energy consumption are analyzed. Finally, by eliminating the recursive process of integer dynamic programming, the optimal algorithm with polynomial complexity is obtained. The numerical results show that the optimal algorithm can ensure the minimum energy consumption and the smooth calculation process under different load trends.
【作者單位】: 合肥工業(yè)大學(xué)計算機(jī)與信息學(xué)院;安全關(guān)鍵工業(yè)測控技術(shù)教育部工程研究中心;
【基金】:國家自然科學(xué)基金項目(61370088)資助 國家國際科技合作專項項目(2014DFB10060)資助 中央高;究蒲袠I(yè)務(wù)費專項資金項目(2011HGBZ1321;2012HGQC0012)資助
【分類號】:TP368.5;TP308
[Abstract]:Cloud computing data centers are made up of a large number of servers connected by high-speed networks. An effective energy saving measure is to maintain the number of active servers in proportion to the system load and switch the remaining servers to idle mode. Thus, the operation energy consumption and the switching energy consumption are generated respectively. In this paper, the problem of how to configure the number of active servers to minimize the energy consumption of data centers under the condition that the load in different service slots is known is studied. First, the NP mathematical model of the problem is established, then the characteristics of the optimal solution without switching energy consumption are analyzed. Finally, by eliminating the recursive process of integer dynamic programming, the optimal algorithm with polynomial complexity is obtained. The numerical results show that the optimal algorithm can ensure the minimum energy consumption and the smooth calculation process under different load trends.
【作者單位】: 合肥工業(yè)大學(xué)計算機(jī)與信息學(xué)院;安全關(guān)鍵工業(yè)測控技術(shù)教育部工程研究中心;
【基金】:國家自然科學(xué)基金項目(61370088)資助 國家國際科技合作專項項目(2014DFB10060)資助 中央高;究蒲袠I(yè)務(wù)費專項資金項目(2011HGBZ1321;2012HGQC0012)資助
【分類號】:TP368.5;TP308
【相似文獻(xiàn)】
相關(guān)期刊論文 前10條
1 江南;數(shù)據(jù)中心如何應(yīng)付管理挑戰(zhàn)[J];互聯(lián)網(wǎng)周刊;2001年40期
2 ;簡化管理挑戰(zhàn)——惠普推實用數(shù)據(jù)中心解決方案[J];每周電腦報;2001年67期
3 李慶莉;去數(shù)據(jù)中心看一看——中國銀行華北信息中心計劃處處長云恩善談數(shù)據(jù)中心運(yùn)行、管理[J];中國金融電腦;2002年12期
4 馬天蔚;;數(shù)據(jù)中心按需造[J];每周電腦報;2002年25期
5 戚麗,蔣東興,武海平,馮珂;校園數(shù)據(jù)中心建設(shè)與管理方法的探索[J];教育信息化;2002年S1期
6 何俊山;您企業(yè)的數(shù)據(jù)中心2003了嗎?[J];微電腦世界;2003年17期
7 ;挖潛數(shù)據(jù)中心[J];金融電子化;2004年07期
8 王琨月;;數(shù)據(jù)中心業(yè)務(wù)就緒[J];每周電腦報;2004年21期
9 包東智;新熱點:創(chuàng)建下一代數(shù)據(jù)中心[J];上海信息化;2005年10期
10 ;把握數(shù)據(jù)中心建設(shè)五大看點[J];中國計算機(jī)用戶;2005年10期
相關(guān)會議論文 前10條
1 姚,
本文編號:2184554
本文鏈接:http://sikaile.net/kejilunwen/jisuanjikexuelunwen/2184554.html
最近更新
教材專著