發(fā)布時(shí)間：2018-06-02 03:14

  本文選題：眾核處理器 + 虛擬計(jì)算群��； 參考：《上海交通大學(xué)》2013年碩士論文

【摘要】：隨著微處理器體系結(jié)構(gòu)技術(shù)的發(fā)展，眾核處理器已經(jīng)成為未來(lái)微處理器的一個(gè)重要發(fā)展方向。如何通過(guò)實(shí)現(xiàn)高效的任務(wù)調(diào)度機(jī)制提高資源利用率和吞吐率，是當(dāng)前學(xué)術(shù)界的研究熱點(diǎn)。 本課題基于片內(nèi)集成數(shù)十到數(shù)百個(gè)簡(jiǎn)單處理器核的眾核處理器，面向不同任務(wù)的動(dòng)態(tài)性、同一任務(wù)的階段性資源需求，提出基于虛擬計(jì)算群的任務(wù)調(diào)度方案以及基于樹(shù)的矩形資源管理算法，有效減少了眾核處理器核間通信代價(jià)，提高簡(jiǎn)單眾核處理器的資源利用率和吞吐率。 本文在三個(gè)方面做了研究，首先綜合考慮核間通信、任務(wù)階段性資源需求等因素提出了基于虛擬計(jì)算群的任務(wù)調(diào)度機(jī)制，主要分為動(dòng)態(tài)映射和在線映射兩個(gè)方面。第二，針對(duì)眾核處理器系統(tǒng)的矩形結(jié)構(gòu)，，提出一種基于樹(shù)的資源管理算法，有效的優(yōu)化了核資源分配問(wèn)題，極大的減少了空閑資源查詢和分配帶來(lái)的時(shí)間延遲，并且為將來(lái)任務(wù)階段性的占有、釋放核資源提供高效的查詢分配措施。第三，在GEM5平臺(tái)上配置建立眾核處理器仿真平臺(tái)，隨機(jī)生成大量的任務(wù)，對(duì)任務(wù)進(jìn)行階段性劃分，應(yīng)用算法實(shí)現(xiàn)任務(wù)調(diào)度和資源分配，對(duì)此進(jìn)行了有效驗(yàn)證。 實(shí)驗(yàn)結(jié)果與傳統(tǒng)多核調(diào)度算法相比，本文提出的算法能夠有效的減少系統(tǒng)執(zhí)行時(shí)間，提高大約18%的系統(tǒng)吞吐率和23%的資源利用率。
[Abstract]:With the development of microprocessor architecture technology, multi-core processor has become an important development direction of microprocessor in the future. How to achieve efficient task scheduling mechanism to improve resource utilization and throughput is a hot topic in academia. This topic is based on the multi-core processor which integrates dozens to hundreds of simple processor cores, which is oriented to the dynamic nature of different tasks and the phase resource requirements of the same task. A task scheduling scheme based on virtual computing group and a tree-based rectangular resource management algorithm are proposed, which can effectively reduce the communication cost between cores and improve the resource utilization and throughput of simple multi-core processors. In this paper, three aspects are studied. Firstly, the task scheduling mechanism based on virtual computing cluster is proposed, which includes dynamic mapping and online mapping. Secondly, for the rectangular structure of multi-core processor system, a tree-based resource management algorithm is proposed, which effectively optimizes the kernel resource allocation problem and greatly reduces the time delay caused by the query and allocation of idle resources. It also provides efficient query and allocation measures for future task stage possession and release of nuclear resources. Thirdly, the multi-core processor simulation platform is configured on the GEM5 platform, and a large number of tasks are generated randomly, the tasks are partitioned into phases, and the task scheduling and resource allocation are implemented by the algorithm, which is validated effectively. Compared with the traditional multi-core scheduling algorithm, the proposed algorithm can effectively reduce the system execution time, improve the system throughput by about 18% and resource utilization by 23%.
【學(xué)位授予單位】：上海交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP332

【共引文獻(xiàn)】

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

1 顧頎;OLAP系統(tǒng)中Cube并行與分布式處理技術(shù)的研究[D];揚(yáng)州大學(xué);2007年

本文編號(hào)：1967099