Font Size: a A A

Research On Application Specific Routing Algorithm For Network On Chip

Posted on:2013-03-29Degree:MasterType:Thesis
Country:ChinaCandidate:K P WangFull Text:PDF
GTID:2248330395456176Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the development of semiconductor technology, the integration of IP core onthe chip has risen dramatically, and the traditional bus-based system on a chip couldn tmeet its performance requirements. An emerging technology, drawing on traditionalcomputer networks–network-on-chip becomes a solution of communication on a chip.the various IP core on the network-on-chip communicate with each other through thenetwork consisting of routers by the way of routing. However, when designingnetwork-on-chip for specific applications, we need to consider higher performance ofarea, delay and power consumption, but it has very low efficiency when using generalpurpose routing algorithm. Therefore, we design application-specific routing algorithmspecific applications based on the communication characteristics of the system todesign.In this thesis, the network-on-chip and its basic concepts are summarizes andanalyzed in the first place, and then some of the existing switch mechanisms and ageneral overview of the routing algorithm are introduced. A conclusion is achieved thatthe efficiency of common purpose routing algorithm in a particular application is verylow. On this basis, the current relatively three typical application-specific routingalgorithms and its comparison of the delay, throughput and average degree of adaptive,etc are described. The communications whose source node and destination node areboth in the edge of the network and far away from each other tend to increase the loopprobability of the channel dependency graph. A new application-specific routingalgorithm by limiting this type of communication by the edge way of the network toreduce the probability of the loop in the channel dependency graph and the probabilityof middle hot spots area emergence of the network is proposed. It has a target ofminimizing the percentage of remaining communication paths after breaking all cyclesin the channel dependency graph. The final performance simulation proves that thenetwork performance of the new routing algorithm is much more excellent.
Keywords/Search Tags:Network-on-chip, channel dependency graph, AdaptiveApplication-specific, routing algorithm
PDF Full Text Request
Related items