發(fā)布時間：2018-12-26 17:20

【摘要】：隨著嵌入式移動多媒體應用的日益豐富與普及，保證智能終端的實時性顯得非常突出。能保證智能終端的處理性能的處理器的快速發(fā)展也使多核處理器上的實時任務調(diào)度問題成為計算機技術領域研究的熱點。目前的研究熱點在于，大量的并行任務運行時，需要平衡任務的實時性和系統(tǒng)的效率，減少總?cè)蝿盏膱?zhí)行時間，并且保證整個系統(tǒng)負載均衡。設計高效的多媒體流計算任務調(diào)度策略是提高異構(gòu)多核處理器系統(tǒng)性能的最直接有效的方法，，具有重要的研究意義。 異構(gòu)多核系統(tǒng)上進行任務的分配及調(diào)度問題已經(jīng)被證明是NP完全問題。普遍認為，采用啟發(fā)式算法解決該問題能得到比較好的解�；诖耍槍σ曨l解碼這一典型的多媒體流計算，提出了一種基于蟻群算法的新型的調(diào)度算法來解決異構(gòu)多核處理器系統(tǒng)的實時任務調(diào)度問題。首先，為實現(xiàn)該算法建立系統(tǒng)模型，以便模擬實際異構(gòu)多核環(huán)境。然后設計了算法的公式，包括任務選擇公式、處理器選擇公式以及任務信息素和處理器信息素更新公式。最后詳細闡述了算法的實現(xiàn)，包括任務的選擇及處理核的選擇。為了滿足異構(gòu)多核系統(tǒng)中任務的實時性要求，設計任務模型時考慮了任務的到達時間，估計運算量以及截止時間等因素。為了模擬異構(gòu)多核環(huán)境，設計處理器模型時考慮了各個內(nèi)核不同的執(zhí)行速度以及內(nèi)核之間的通信帶寬等。該算法能較好的滿足任務間的執(zhí)行優(yōu)先約束關系以及截止時間的要求，取得較優(yōu)的總?cè)蝿照{(diào)度長度。 使用Matlab7.0實現(xiàn)了該算法，以評估上述異構(gòu)多核系統(tǒng)中基于蟻群的實時任務調(diào)度算法的性能，并對算法參數(shù)的取值進行討論。實驗表明，該算法能用于解決異構(gòu)多核系統(tǒng)中實時任務的調(diào)度問題，并且具有較好的收斂性。
[Abstract]:With the increasing richness and popularity of embedded mobile multimedia applications, it is very important to ensure the real-time performance of intelligent terminals. With the rapid development of processors which can guarantee the processing performance of intelligent terminals, the real-time task scheduling problem on multi-core processors has become a hot topic in the field of computer technology. The current research focus is that when a large number of parallel tasks are running, it is necessary to balance the real time of the task and the efficiency of the system, reduce the execution time of the total task, and ensure the load balance of the whole system. The design of efficient task scheduling strategy for multimedia stream computing is the most direct and effective method to improve the performance of heterogeneous multi-core processors. Task assignment and scheduling on heterogeneous multicore systems have been proved to be NP complete problems. It is generally believed that the heuristic algorithm can get a better solution to the problem. Based on this, a new scheduling algorithm based on ant colony algorithm is proposed to solve the real-time task scheduling problem in heterogeneous multi-core processor systems. Firstly, the system model is built to simulate the real heterogeneous multi-core environment. Then the formula of the algorithm is designed, including the formula of task selection, the formula of processor selection and the formula of task pheromone and processor pheromone update. Finally, the implementation of the algorithm, including task selection and processing kernel selection, is described in detail. In order to meet the real-time requirements of tasks in heterogeneous multi-core systems, the task model is designed taking into account such factors as the time of arrival, the estimation of computation and the deadline, etc. In order to simulate heterogeneous multi-core environment, the processor model is designed with different execution speed and communication bandwidth between cores. The algorithm can satisfy the requirements of execution priority constraint and deadline between tasks, and obtain a better total task scheduling length. The algorithm is implemented with Matlab7.0 to evaluate the performance of the real-time task scheduling algorithm based on ant colony in the heterogeneous multi-core system, and the parameters of the algorithm are discussed. Experiments show that the algorithm can be used to solve the real-time task scheduling problem in heterogeneous multi-core systems and has good convergence.
【學位授予單位】：華中科技大學
【學位級別】：碩士
【學位授予年份】：2013
【分類號】：TP332

【參考文獻】

相關期刊論文 前2條

1 王劍,李平,楊春節(jié);蟻群算法的理論與應用[J];機電工程;2003年05期

2 黃國睿;張平;魏廣博;;多核處理器的關鍵技術及其發(fā)展趨勢[J];計算機工程與設計;2009年10期

本文編號：2392439