Font Size: a A A

Research On Efficient OBLIVIOUS Routing Algorithm Based On 3D-MESH Network

Posted on:2019-12-12Degree:MasterType:Thesis
Country:ChinaCandidate:Z J WangFull Text:PDF
GTID:2438330545990747Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
With the rapid development of semiconductor technology,the future integrated system will contain hundreds of millions of transistors,consisting of hundreds of IP cores.Network-on-Chip(NoC)can accommodate many IP cores,and meet the requirements of communication and data transmission.At the same time,with the increase of the number of IP cores on chip,the area and power consumption of the chip are increasing.In recent years,with the development of three-dimensional integrated circuits,three-dimensional network on chip(Three-dimensional network-on-chip,3D NoC)with its shorter interconnect and higher packing density,smaller volume and many other advantages,has gradually become the main research direction in the field of NoC,The most common topology in 3D NoC is the 3D-Mesh network structure.Therefore,it is very important to design efficient deadlock free routing algorithms in 3D-Mesh networks.Network throughput and transmission delay are important indexes to evaluate the performance of an interconnection network.An ideal routing algorithm should have the largest throughput and minimum message transmission delay at the same time.The routing algorithm mainly consists of adaptive routing algorithms and deterministic routing algorithm,adaptive routing algorithm in routing message is according to the current path in the network busy degree,choose the path to the destination node,which can not meet the characteristics of the message transmission delay minimum.At the same time,it requires each node to traverse the entire network and grasp the state of the entire network,which increases the complexity of the router and greatly increases the cost.While deterministic routing does not need to consider the network status,which greatly reduces the complexity of router structure,random Oblivious routing algorithm is random and select the routing path in deterministic routing algorithm based on,when routing decisions,do not consider the routing algorithm of network status,this feature greatly reduces the complexity at the same time,the router structure,by randomly selecting the routing path routing,Oblivious routing algorithm has higher flexibility and can achieve better performance.Because of the random Oblivious routing algorithm has the advantages of simple structure and good performance,which can be applied in the 3DMesh network,can better satisfy the message transmission delay,the minimum worst-case maximum and average network throughput.Random Oblivious routing algorithm based on 3D-Mesh network,respectively,two kinds of improved algorithm,experiments show that the routing algorithm and the average case throughput compared to the algorithm have achieved good results.
Keywords/Search Tags:3D-Mesh, Oblivious algorithm, average network throughput, transmission delay, DPT, NRPM, TD-NRPM
PDF Full Text Request
Related items