發(fā)布時(shí)間：2018-03-09 13:12

  本文選題：云環(huán)境　切入點(diǎn)：資源分配　出處：《大連理工大學(xué)》2016年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著信息產(chǎn)業(yè)的急速發(fā)展,迎來了大數(shù)據(jù)的時(shí)代。網(wǎng)絡(luò)中數(shù)據(jù)量的劇增給已經(jīng)成熟的網(wǎng)絡(luò)結(jié)構(gòu)提出了巨大的挑戰(zhàn)。云計(jì)算是依托成熟的虛擬化技術(shù),從網(wǎng)格計(jì)算、分布式計(jì)算和協(xié)同計(jì)算的基礎(chǔ)上發(fā)展出來的。而云環(huán)境具有異構(gòu)性和動(dòng)態(tài)性,如何根據(jù)用戶及任務(wù)的特點(diǎn)和需求進(jìn)行資源的合理分配是需要解決的重要問題之一。針對(duì)大型云計(jì)算環(huán)境下的多節(jié)點(diǎn)協(xié)作問題建立了動(dòng)態(tài)分級(jí)的網(wǎng)絡(luò)計(jì)算模型,并進(jìn)一步提出了動(dòng)態(tài)分級(jí)的資源分配算法(Dynamically Hierarchical Resource-Allocation Algorithm,DHRA).動(dòng)態(tài)分級(jí)網(wǎng)絡(luò)計(jì)算模型采用模糊模式識(shí)別理論,根據(jù)任務(wù)和資源節(jié)點(diǎn)的信息將其動(dòng)態(tài)地分為不同的等級(jí)。從而形成動(dòng)態(tài)分級(jí)的網(wǎng)絡(luò)計(jì)算模型。因此對(duì)于每個(gè)任務(wù)只需要在相應(yīng)等級(jí)的節(jié)點(diǎn)中尋找合適的節(jié)點(diǎn)執(zhí)行即可,有效地減小了問題的規(guī)模。在此基礎(chǔ)上,在資源分配算法中引入多Agent機(jī)制,增加了系統(tǒng)的可靠性和自主性。綜合考慮了任務(wù)的完成時(shí)間、節(jié)點(diǎn)的負(fù)載、系統(tǒng)通信量等因素,使得算法在各方面都有較好的性能和效率。對(duì)于由大型應(yīng)用分解的相互關(guān)聯(lián)子任務(wù)的并行計(jì)算問題,由于所有任務(wù)的計(jì)算量和所需資源等信息都是已知的,采用隨機(jī)搜索類算法中的遺傳算法。并為了實(shí)現(xiàn)多方面的性能優(yōu)化,提出多目標(biāo)遺傳算法(Multi-Object Genetic Algorithm, MOGA)。采用任務(wù)完成時(shí)間和任務(wù)節(jié)點(diǎn)相關(guān)性兩個(gè)適應(yīng)度函數(shù)共同控制種群的進(jìn)化方向。實(shí)現(xiàn)了在保證完成時(shí)間的前提下減少通信量的目的。對(duì)于DHRA算法和傳統(tǒng)的協(xié)商算法產(chǎn)生的通信量,進(jìn)行了定量的理論分析,證明DHRA算法可以有效地減少系統(tǒng)通信量。并且對(duì)DHRA算法和MOGA算法在不同的任務(wù)和節(jié)點(diǎn)數(shù)時(shí)進(jìn)行多組仿真實(shí)驗(yàn)。將DHRA算法與MinMin算法進(jìn)行對(duì)比,DHRA算法有效地減少的系統(tǒng)通信量的產(chǎn)生,同時(shí)保證任務(wù)完成時(shí)間也有一定的減少。有效地提高了系統(tǒng)的穩(wěn)定性和執(zhí)行效率。同樣地,對(duì)MOGA算法與傳統(tǒng)GA算法進(jìn)行比較,在相同的條件下MOGA算法獲得了比傳統(tǒng)遺傳算法更少的任務(wù)完成時(shí)間和通信量。都有效地提高了系統(tǒng)的穩(wěn)定性和執(zhí)行效率。
[Abstract]:With the rapid development of information industry, the era of big data is ushered in. The huge increase in the amount of data in the network poses a great challenge to the mature network structure. Cloud computing is based on mature virtualization technology, from grid computing, Developed on the basis of distributed computing and collaborative computing. The cloud environment is heterogeneous and dynamic. How to allocate resources reasonably according to the characteristics and requirements of users and tasks is one of the important problems to be solved. A dynamic hierarchical network computing model is established to solve the multi-node collaboration problem in large-scale cloud computing environment. Furthermore, a dynamic Hierarchical Resource-Allocation algorithm is proposed for dynamic resource allocation. Fuzzy pattern recognition theory is used in the computing model of dynamic hierarchical network. According to the information of the task and resource nodes, they are dynamically divided into different levels. Thus, a dynamic hierarchical network computing model is formed. Therefore, for each task, it is only necessary to find the appropriate node in the corresponding level node to execute the task. On the basis of this, the multiple Agent mechanism is introduced into the resource allocation algorithm, which increases the reliability and autonomy of the system. The factors such as the completion time of the task, the load of the node, the traffic of the system, and so on, are considered synthetically. The algorithm has better performance and efficiency in all aspects. For parallel computing problems of interrelated subtasks decomposed by large applications, the information of all tasks is known, such as the amount of computation and the resources required. The genetic algorithm is used in the random search algorithm, and in order to optimize the performance of many aspects, A multi-objective genetic algorithm named Multi-Object Genetic algorithm (Moga) is proposed to control the evolution direction of the population by using two fitness functions: task completion time and task node correlation. The goal of reducing traffic while ensuring completion time is achieved. For the traffic generated by the DHRA algorithm and the traditional negotiation algorithm, A quantitative theoretical analysis was carried out. It is proved that the DHRA algorithm can effectively reduce the system traffic, and the simulation experiments of DHRA algorithm and MOGA algorithm are carried out in different tasks and nodes. Compared with MinMin algorithm, the DHRA algorithm can effectively reduce the system. The generation of communication traffic, At the same time, the task completion time is also reduced, which effectively improves the stability and efficiency of the system. Similarly, the MOGA algorithm is compared with the traditional GA algorithm. Under the same conditions, the MOGA algorithm achieves less task completion time and traffic than the traditional genetic algorithm, and improves the stability and efficiency of the system effectively.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TP3

【參考文獻(xiàn)】

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

1 熊聰聰;馮龍;陳麗仙;蘇靜;;云計(jì)算中基于遺傳算法的任務(wù)調(diào)度算法研究[J];華中科技大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年S1期

2 朱宗斌;杜中軍;;基于改進(jìn)GA的云計(jì)算任務(wù)調(diào)度算法[J];計(jì)算機(jī)工程與應(yīng)用;2013年05期

3 王占杰;劉晶晶;;基于多Agent的分布式多目標(biāo)任務(wù)調(diào)度機(jī)制研究[J];大連理工大學(xué)學(xué)報(bào);2011年05期

4 尹超;黃必清;劉飛;聞立杰;王朝坤;黎曉東;楊書評(píng);葉丹;柳先輝;;中小企業(yè)云制造服務(wù)平臺(tái)共性關(guān)鍵技術(shù)體系[J];計(jì)算機(jī)集成制造系統(tǒng);2011年03期

5 李建鋒;彭艦;;云計(jì)算環(huán)境下基于改進(jìn)遺傳算法的任務(wù)調(diào)度算法[J];計(jì)算機(jī)應(yīng)用;2011年01期

6 林劍檸,吳慧中;基于遺傳算法的網(wǎng)格資源調(diào)度算法[J];計(jì)算機(jī)研究與發(fā)展;2004年12期

，

本文編號(hào)：1588683