本文選題：片上網(wǎng)絡(luò)　切入點(diǎn)：路由算法　出處：《曲阜師范大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著半導(dǎo)體制作工藝技術(shù)的高速發(fā)展,系統(tǒng)網(wǎng)絡(luò)的總線結(jié)構(gòu)嚴(yán)重制約著其自身的發(fā)展,其網(wǎng)絡(luò)傳輸速率無法滿足用戶的需求。為了解決總線所帶來的問題,人們提出了“片上網(wǎng)絡(luò)”的思想,片上網(wǎng)絡(luò)的研究越來越引起人們的關(guān)注�，F(xiàn)階段片上網(wǎng)絡(luò)研究的主要方向有拓?fù)浣Y(jié)構(gòu)、路由算法、流量控制、無死鎖、容錯(cuò)與性能分析等方面。本文主要研究的方向是自適應(yīng)路由算法,自適應(yīng)路由算法不僅要考慮網(wǎng)絡(luò)的可通性,還要考慮網(wǎng)絡(luò)的需求,以便達(dá)到網(wǎng)絡(luò)性能的最優(yōu)化。分析了片上網(wǎng)絡(luò)國(guó)內(nèi)外發(fā)展的現(xiàn)狀以及本課題的意義,同時(shí)研究了NoC各類路由算法的工作原理以及它們的優(yōu)缺點(diǎn)。在此基礎(chǔ)上,根據(jù)低時(shí)延、低功耗、無死鎖、無擁塞等網(wǎng)絡(luò)性能之間的平衡原則,本文提出了兩種自適應(yīng)路由算法,此算法優(yōu)化網(wǎng)絡(luò)的性能,滿足用戶的網(wǎng)絡(luò)需求。針對(duì)2D Mesh結(jié)構(gòu)下XY路由算法易出現(xiàn)路徑單一與擁塞的問題,本文提出了一種基于虛擬通道的自適應(yīng)路由算法。此算法先分析網(wǎng)絡(luò)通信狀態(tài),并根據(jù)網(wǎng)絡(luò)適應(yīng)度進(jìn)行選取一條合適的路由路徑進(jìn)行數(shù)據(jù)傳輸,同時(shí)每個(gè)路由節(jié)點(diǎn)加入擁塞控制機(jī)制,避免網(wǎng)絡(luò)發(fā)生擁塞,進(jìn)而提高網(wǎng)絡(luò)傳輸?shù)耐掏铝�。與XY路由算法相比,在性能方面本算法在吞吐量、傳輸時(shí)延與功耗等方面有很大的提高。針對(duì)2D Mesh結(jié)構(gòu)下的片上網(wǎng)絡(luò)在傳輸數(shù)據(jù)包時(shí),源節(jié)點(diǎn)與目標(biāo)節(jié)點(diǎn)之間相距較遠(yuǎn)時(shí)所消耗的時(shí)延與功耗會(huì)相應(yīng)升高,并有可能出現(xiàn)路徑局部擁塞現(xiàn)象,本文提出的基于Mesh-Tree拓?fù)浣Y(jié)構(gòu)下的自適應(yīng)路由算法可以解決此問題。此算法在設(shè)計(jì)網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)方面先將網(wǎng)絡(luò)結(jié)構(gòu)劃分成若干區(qū)域,并于此區(qū)域上增加了一個(gè)上層路由節(jié)點(diǎn),此節(jié)點(diǎn)作為數(shù)據(jù)包在源/目標(biāo)節(jié)點(diǎn)之間傳輸?shù)闹薪?從而縮短了網(wǎng)絡(luò)的時(shí)延與功耗,減少網(wǎng)絡(luò)擁塞現(xiàn)象的產(chǎn)生。本文所提出的兩種路由算法都是犧牲網(wǎng)絡(luò)某方面的性能,從而提高網(wǎng)絡(luò)其它方面的性能:第一種VARA路由算法的適用范圍為2D Mesh結(jié)構(gòu),提高了吞吐量、時(shí)延與功耗等方面的性能;第二種路由算法從拓?fù)浣Y(jié)構(gòu)為入口,雖然它能夠改變網(wǎng)絡(luò)性能和增加網(wǎng)絡(luò)路徑,但是此路由算法不能很好的拓展,只能適用于特定的路由結(jié)構(gòu)。因此NoC的設(shè)計(jì)時(shí)選取合適路由算法至關(guān)重要,這不僅關(guān)系著用戶的需求,而且還與網(wǎng)絡(luò)的性能有關(guān)。
[Abstract]:With the rapid development of semiconductor manufacturing technology, the system network bus structure seriously restricts its own development, its network transmission rate can not meet the needs of users. People have put forward the idea of "on-chip network", and the research of on-chip network has attracted more and more attention. At present, the main research directions of on-chip network are topology, routing algorithm, flow control, deadlock-free, etc. The main research direction of this paper is adaptive routing algorithm. Adaptive routing algorithm should consider not only the network passability, but also the network requirement. In order to optimize the network performance, this paper analyzes the current situation of on-chip network development at home and abroad and the significance of this topic, and studies the working principle of various routing algorithms of NoC and their advantages and disadvantages. On this basis, according to the low delay, In this paper, two adaptive routing algorithms are proposed to optimize the performance of the network, such as low power, deadlock-free and congestion free network performance. To meet the network requirements of users, an adaptive routing algorithm based on virtual channel is proposed to solve the problem of single path and congestion in XY routing algorithm based on 2D Mesh structure. According to the network fitness, a suitable routing path is selected for data transmission. At the same time, each routing node adds a congestion control mechanism to avoid network congestion and improve the throughput of network transmission. In terms of performance, the algorithm has a great improvement in throughput, transmission delay and power consumption. When the distance between the source node and the target node is far away, the delay and power consumption will increase correspondingly, and the local congestion of the path may occur. The proposed adaptive routing algorithm based on Mesh-Tree topology can solve this problem. In the design of network topology, the network structure is divided into several regions, and an upper routing node is added to this region. This node acts as an intermediary between source and target nodes, which shortens the delay and power consumption of the network and reduces the network congestion. The two routing algorithms proposed in this paper sacrifice the performance of some aspect of the network. So as to improve the performance of other aspects of the network: the first VARA routing algorithm for 2D Mesh structure, improve the throughput, delay and power consumption, and other aspects of the performance of the second routing algorithm from the topology as the entry, Although it can change the network performance and increase the network path, but this routing algorithm can not be extended very well, it can only be applied to specific routing structure. Therefore, it is very important to select the appropriate routing algorithm in the design of NoC. This is not only related to the needs of users, but also related to the performance of the network.
【學(xué)位授予單位】：曲阜師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TN47

【參考文獻(xiàn)】

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

1 歐陽一鳴;董少周;梁華國(guó);;基于2D Mesh的NoC路由算法設(shè)計(jì)與仿真[J];計(jì)算機(jī)工程;2009年22期

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

1 董少周;NoC路由算法及仿真模型的設(shè)計(jì)與研究[D];合肥工業(yè)大學(xué);2009年

，

本文編號(hào)：1609286