本文選題：云計(jì)算　切入點(diǎn)：數(shù)據(jù)中心　出處：《合肥工業(yè)大學(xué)》2014年碩士論文

【摘要】：隨著社會(huì)對(duì)云計(jì)算需求的持續(xù)擴(kuò)大,規(guī)模巨大的數(shù)據(jù)中心不斷被建立,而維護(hù)其運(yùn)行需要大量的能量。隨著傳統(tǒng)能源的逐漸枯竭和價(jià)格的飛漲,維護(hù)運(yùn)行數(shù)據(jù)中心的費(fèi)用將會(huì)超過購(gòu)買系統(tǒng)硬件的費(fèi)用。因此如何高能效地運(yùn)行數(shù)據(jù)中心是一個(gè)亟待解決的問題。近年來的研究熱點(diǎn)是基于“綠色”配置理念,即使得數(shù)據(jù)中心的能量消耗與系統(tǒng)負(fù)載成正比。然而,當(dāng)前的云計(jì)算數(shù)據(jù)中心(比如HOTMAIL和微軟研究院)也遠(yuǎn)達(dá)不到這個(gè)目標(biāo),甚至系統(tǒng)空閑時(shí)的能量消耗也達(dá)到其峰值的一半左右。由于面向云計(jì)算的數(shù)據(jù)中心一般由大量服務(wù)器組成,一種廣泛被國(guó)內(nèi)外學(xué)者接受的有效綠色配置方式,是使用軟件動(dòng)態(tài)的調(diào)整活躍服務(wù)器數(shù)量與系統(tǒng)負(fù)載相匹配；在進(jìn)行系統(tǒng)任務(wù)調(diào)度時(shí)進(jìn)行合理的分配負(fù)載使得某些服務(wù)器,在較低負(fù)載時(shí)間段內(nèi)無需承擔(dān)任何任務(wù)進(jìn)程,從而進(jìn)入低功耗模式以節(jié)約能源。本文的研究對(duì)象為同構(gòu)服務(wù)器組成的數(shù)據(jù)中心,將其服務(wù)運(yùn)行過程劃分為若干時(shí)間周期,根據(jù)每個(gè)周期內(nèi)的負(fù)載信息基于歷史統(tǒng)計(jì)或在線預(yù)測(cè)獲得,將“綠色配置”策略分為離線算法和在線算法。離線算法適用于每個(gè)周期負(fù)載已知的情況,其最優(yōu)化結(jié)果一方面提供活躍服務(wù)器數(shù)量精準(zhǔn)的評(píng)估,另一方面為在線算法設(shè)置了較好的預(yù)測(cè)基礎(chǔ)。首先在任意周期內(nèi)考慮操作能耗以及在相鄰周期之間考慮切換能耗,建立了數(shù)據(jù)中心能耗最小化數(shù)學(xué)模型；針對(duì)模型中出現(xiàn)的非線性約束,通過公式重建的方法進(jìn)行簡(jiǎn)化。作為后續(xù)討論最優(yōu)離線算法的基礎(chǔ),首先對(duì)兩種特殊情況(無操作能耗和無切換能耗)下的最優(yōu)解進(jìn)行討論,進(jìn)一步引出一般情況下的最優(yōu)解特性,并給出了相關(guān)引理及證明過程。其次,給出了服務(wù)器綠色配置的最優(yōu)離線算法。算法基于整數(shù)動(dòng)態(tài)規(guī)劃思想,一般具有指數(shù)復(fù)雜度。通過消除動(dòng)態(tài)規(guī)劃中的遞推過程,其具有多項(xiàng)式復(fù)雜度。針對(duì)于不同負(fù)載變化趨勢(shì)的數(shù)值結(jié)果表明,所提最優(yōu)離線算法能保證能耗達(dá)到最小的同時(shí)計(jì)算過程平穩(wěn)。最后,針對(duì)工作負(fù)載可能遇到的最差情況,設(shè)計(jì)了在線算法,該算法沿用了滾動(dòng)時(shí)域控制的思想。通過仿真與最優(yōu)離線算法的結(jié)果進(jìn)行比較,得出在線算法為近似最優(yōu)的結(jié)論。保持合適數(shù)量的活躍服務(wù)器提供及時(shí)服務(wù)的同時(shí),盡可能地切換服務(wù)器到空閑模式以減少能耗是一種有效的節(jié)能措施。本文的工作為云計(jì)算數(shù)據(jù)中心的綠色配置技術(shù)提供了一定程度的理論成果。
[Abstract]:As society continues to grow in demand for cloud computing, huge data centers are being built, and maintaining them requires a lot of energy. The cost of maintaining and running the data center will exceed the cost of purchasing the hardware of the system. Therefore, how to run the data center efficiently is an urgent problem. In recent years, the research focus is based on the concept of "green" configuration. Even if the energy consumption of the data center is proportional to the system load, today's cloud computing data centers, such as HOTMAIL and Microsoft Research, are far from achieving this goal. Even when the system is idle, the energy consumption is about half of its peak. Because the data center for cloud computing is generally composed of a large number of servers, it is an effective green configuration method widely accepted by domestic and foreign scholars. Is to use software to dynamically adjust the number of active servers to match the system load; to distribute the load so that some servers do not have to undertake any task processes during lower load periods, In order to save energy, the research object of this paper is the data center composed of isomorphic servers, and the service running process is divided into several time periods. According to the load information in each cycle based on historical statistics or online prediction, the "green collocation" strategy is divided into offline algorithm and online algorithm. The optimization results provide an accurate evaluation of the number of active servers on the one hand, and a better prediction basis for online algorithms on the other. First, the operation energy consumption is considered within any period and the switching energy consumption is considered between adjacent cycles. The mathematical model of data center energy consumption minimization is established, and the nonlinear constraints in the model are simplified by the method of formula reconstruction, which is the basis of the following discussion on the optimal off-line algorithm. First, the optimal solutions of two special cases (no operating energy consumption and no switching energy consumption) are discussed, and then the properties of the optimal solutions in general cases are derived, and the relevant Lemma and the proof process are given. The optimal off-line algorithm of server green configuration is presented. The algorithm is based on integer dynamic programming and has exponential complexity. It has polynomial complexity. The numerical results for different load trends show that the proposed optimal off-line algorithm can ensure the minimum energy consumption and smooth calculation process. Finally, for the worst case that the workload may encounter, An online algorithm is designed, which adopts the idea of rolling time domain control. The simulation results are compared with the results of the optimal off-line algorithm. Draw the conclusion that the online algorithm is approximately optimal. While maintaining a suitable number of active servers to provide timely services, Switching servers to idle mode as much as possible to reduce energy consumption is an effective energy saving measure. The work of this paper provides a certain degree of theoretical results for the green configuration technology of cloud computing data center.
【學(xué)位授予單位】：合肥工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.09

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 高巍;;云計(jì)算帶來的數(shù)據(jù)中心變革[J];電信網(wǎng)技術(shù);2011年09期

2 曹魯;;云計(jì)算數(shù)據(jù)中心建設(shè)運(yùn)營(yíng)分析[J];電信網(wǎng)技術(shù);2012年02期

3 秦婷;張高記;;數(shù)據(jù)中心節(jié)能減排措施探討[J];西安郵電大學(xué)學(xué)報(bào);2013年04期

4 張秋華;數(shù)據(jù)中心探討[J];中國(guó)計(jì)算機(jī)用戶;2000年46期

5 梅玖紅;建什么樣的數(shù)據(jù)中心[J];中國(guó)計(jì)算機(jī)用戶;2000年47期

6 ;數(shù)據(jù)中心亮起來[J];每周電腦報(bào);2000年31期

7 ;工商銀行舉行數(shù)據(jù)中心(北京)基建工程奠基儀式[J];中國(guó)金融電腦;2001年07期

8 高軍 ,李強(qiáng);數(shù)據(jù)中心集中——商業(yè)銀行電子化建設(shè)的里程碑[J];中國(guó)金融電腦;2001年12期

9 周衛(wèi)軍;安萊將在重點(diǎn)城市興建數(shù)據(jù)中心[J];互聯(lián)網(wǎng)周刊;2001年10期

10 江南;開源節(jié)流從簡(jiǎn)化架構(gòu)開始[J];互聯(lián)網(wǎng)周刊;2001年43期

相關(guān)會(huì)議論文 前10條

1 姚，

本文編號(hào)：1678536