Paper Info
Title
Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions
Abstract
Region concept helps to accommodate cores larger than the tile size in mesh topology NoC architectures. In addition, it offers many new opportunities for NoC design, as well as provides new design issues and challenges. The most important among these is the design of a deadlock free routing algorithm. In this paper, we present and compare two routing algorithms for mesh topology NoC with regions. The first algorithm is borrowed from the area of fault tolerant networks and is adapted for the NoC context. We compare this with an algorithm designed using a methodology for design of application specific routing algorithms for communication networks. Our study shows that the application specific routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases.
Year
DOI
Venue
2006
10.1109/DSD.2006.36
Dubrovnik
Keywords
Field
DocType
application specific routing,new design issue,deadlock free routing algorithm,routing algorithms,routing algorithm,application specific routing algorithm,noc design,mesh topology noc,mesh topology noc systems,new opportunity,mesh topology noc architecture,deadlock free routing algorithms,noc context,networks on chip,wormhole switching,communication network,deadlock,information science,network routing,network on chip,algorithm design,fault tolerant,network topology,fault tolerance
Mesh networking,Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Deadlock,Parallel computing,Network on a chip,Computer network,Destination-Sequenced Distance Vector routing,Network topology,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2609-8
12
0.71
References 
Authors
10
3
Name
Order
Citations
PageRank
Rickard Holsmark124913.10
Maurizio Palesi2111978.82
Shashi Kumar328216.58