本文選題：智能 + 分布式算法　； 參考：《南京郵電大學(xué)》2012年碩士論文

【摘要】：隨著計算機網(wǎng)絡(luò)的普遍應(yīng)用,分布式系統(tǒng)已成為計算機應(yīng)用的基本形式。由于分布式算法是分布式系統(tǒng)中的關(guān)鍵技術(shù)之一,并影響著系統(tǒng)的性能,所以它得到了學(xué)者和工程師們的高度關(guān)注。 在簡要介紹了分布式算法和智能算法后,敘述了本文主要研究的任務(wù)分配算法和協(xié)調(diào)者選舉算法的研究現(xiàn)狀。 本文采用智能計算中的粒子群算法解決分布式系統(tǒng)的獨立任務(wù)調(diào)度問題。針對算法過早地陷入局部極值的缺點,提出自適應(yīng)慣性權(quán)重和保持種群多樣性的規(guī)則;為了保持系統(tǒng)的負載均衡,建立新的適應(yīng)度函數(shù);將改進的算法應(yīng)用于任務(wù)調(diào)度問題,在建立了一個簡單網(wǎng)絡(luò)模型后,對算法進行測試。仿真結(jié)果表明,算法在獨立任務(wù)調(diào)度中具有良好的性能,并在負載均衡方面相比其他算法有明顯的改善。 協(xié)調(diào)者選舉是分布式計算中的一個基本問題。在分析了經(jīng)典的分布式選舉協(xié)調(diào)者算法后,提出了啟發(fā)式搜索和消息并行傳遞的思想;建立一種雙向環(huán)的選舉模型,并據(jù)此設(shè)計了相應(yīng)的選舉算法;對該算法進行了性能分析,并與經(jīng)典的選舉算法進行比較。結(jié)果表明,新的算法在選舉出新協(xié)調(diào)者所花費的時間更少。 上述工作證實,將智能的思想引入到分布式算法的設(shè)計,能使程序快速、合理的運行,從而提高系統(tǒng)的效率。
[Abstract]:With the widespread application of computer network, distributed system has become the basic form of computer application. Because distributed algorithm is one of the key technologies in distributed system and affects the performance of the system, it has been highly concerned by scholars and engineers. After a brief introduction of distributed algorithm and intelligent algorithm, the research status of task assignment algorithm and coordinator election algorithm, which is mainly studied in this paper, is described. In this paper, particle swarm optimization (PSO) algorithm is used to solve the independent task scheduling problem in distributed systems. In order to maintain the load balance of the system, a new fitness function is established, and the improved algorithm is applied to the task scheduling problem, aiming at the disadvantage that the algorithm falls into local extremum prematurely, and puts forward the rules of adaptive inertial weight and population diversity, in order to maintain the load balance of the system, establish a new fitness function. After establishing a simple network model, the algorithm is tested. The simulation results show that the algorithm has a good performance in independent task scheduling, and has a significant improvement compared with other algorithms in load balancing. Coordinator election is a basic problem in distributed computing. After analyzing the classical distributed election coordinator algorithm, this paper puts forward the idea of heuristic search and message passing in parallel, establishes an election model of bidirectional loop, and designs the corresponding election algorithm accordingly, and analyzes the performance of the algorithm. And compared with the classical election algorithm. The results show that the new algorithm takes less time to select the new coordinator. The above work proves that introducing the idea of intelligence into the design of distributed algorithm can make the program run quickly and reasonably and thus improve the efficiency of the system.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2012
【分類號】：TP338.8

【引證文獻】

相關(guān)碩士學(xué)位論文 前1條

1 李奇;基于分布式算法的雷達組網(wǎng)抗干擾優(yōu)化部署研究[D];西安電子科技大學(xué);2013年

，

本文編號：2067763