發(fā)布時間：2018-03-22 19:40

  本文選題：片上網(wǎng)絡(luò)　切入點：自相似業(yè)務(wù)量　出處：《西南科技大學》2017年碩士論文　論文類型：學位論文

【摘要】：隨著半導(dǎo)體集成電路的快速發(fā)展,片上組件集成度越來越高,總線通信結(jié)構(gòu)已經(jīng)無法滿足芯片設(shè)計的需要,為了解決這一問題,片上網(wǎng)絡(luò)(Network on Chip,NoC)這種新型通信架構(gòu)被提出。由于NoC的性能高度依賴于實際業(yè)務(wù)量,因此基于業(yè)務(wù)量開展的一系列研究具有重要意義。在NoC的自相似業(yè)務(wù)量特征下,重點研究了 NoC的映射和緩存分配問題。NoC映射結(jié)果很大程度上影響著能耗、延時等性能,當前的NoC映射研究幾乎沒有考慮業(yè)務(wù)量自相似特性對能耗和延時的影響。為此,在NoC自相似業(yè)務(wù)量下,從減少通信距離的角度建立能耗模型;另一方面,引入時延因子的概念建立延時模型,從系統(tǒng)負載分布、業(yè)務(wù)量突發(fā)強度和系統(tǒng)無擁塞延時三個方面對延時性能進行優(yōu)化。本文結(jié)合映射問題特點使用改進的NSGAⅡ算法優(yōu)化能耗和時延因子。通過幾組任務(wù)流圖的仿真實驗表明:與傳統(tǒng)NSGAⅡ算法、MOGA算法相比,改進算法使得能耗和延時均有明顯降低,并且具有良好的收斂性。關(guān)于NoC緩存分配問題,在對路由器結(jié)構(gòu)進行分析的基礎(chǔ)上,建立一種自相似業(yè)務(wù)量下的排隊延時計算模型,并基于遺傳模擬退火算法設(shè)計一種緩存分配優(yōu)化算法,實驗表明,該算法能夠極大的降低NoC輸入通道的平均排隊時間。
[Abstract]:With the rapid development of semiconductor integrated circuits and the increasing integration of on-chip components, the bus communication structure can no longer meet the needs of chip design. Network on Chip (NOC), a new communication architecture, is proposed. Because the performance of NoC is highly dependent on actual traffic, a series of researches based on traffic are of great significance. Under the characteristics of NoC's self-similar traffic, This paper focuses on the mapping and buffer allocation of NoC. NOC mapping results greatly affect the performance of energy consumption, delay and so on. The current research of NoC mapping hardly takes into account the effect of self-similarity of traffic on energy consumption and delay. In the case of NoC self-similar traffic, the energy consumption model is established from the angle of reducing the communication distance, on the other hand, the concept of delay factor is introduced to establish the delay model, which is based on the system load distribution. The performance of delay is optimized from three aspects: traffic burst intensity and congestion free delay. Based on the characteristics of mapping problem, the improved NSGA 鈪，

本文編號：1650095