loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
9th EUROMICRO Conference on Digital System Design (DSD'06)
Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions
Cavtat near Dubrovnik, Croatia
August 30-September 01
ISBN: 0-7695-2609-8
Rickard Holsmark, J?nk?ping University, Sweden
Maurizio Palesi, DIIT, University of Catania, Italy
Shashi Kumar, J?nk?ping University, Sweden
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.
Index Terms:
Routing Algorithms, Networks on Chip, Deadlock, Wormhole Switching, Application Specific Routing
Citation:
Rickard Holsmark, Maurizio Palesi, Shashi Kumar, "Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions," dsd, pp.696-703, 9th EUROMICRO Conference on Digital System Design (DSD'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.