Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions

Authors:
Rickard Holsmark;Maurizio Palesi;Shashi Kumar
Affiliations:
Jönköping University, Sweden;DIIT, University of Catania, Italy;Jönköping University, Sweden
Venue:
DSD '06 Proceedings of the 9th EUROMICRO Conference on Digital System Design
Year:
2006

Citing 0
Cited 4

Resource-efficient routing and scheduling of time-constrained streaming communication on networks-on-chip

Journal of Systems Architecture: the EUROMICRO Journal
Deadlock free routing algorithms for irregular mesh topology NoC systems with rectangular regions

Journal of Systems Architecture: the EUROMICRO Journal
HiRA: A methodology for deadlock free routing in hierarchical networks on chip

NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
Framework for simulation of heterogeneous MpSoC for design space exploration

VLSI Design

Quantified Score

Hi-index	0.00

Visualization

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.