Region-based routing: a mechanism to support efficient routing algorithms in NoCs

  • Authors:
  • Andres Mejia;Maurizio Palesi;José Flich;Shashi Kumar;Pedro López;Rickard Hoismark;José Duato

  • Affiliations:
  • Universidad Politécnica de Valencia, Valencia, Spain;Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Facolt di Ingegneria, University di Catania, Catania, Italy;Universidad Politécnica de Valencia, Valencia, Spain;Jönköping University, Jönköping, Sweden;Universidad Politécnica de Valencia, Valencia, Spain;Jönköping University, Jönköping, Sweden;Universidad Politécnica de Valencia, Valencia, Spain

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

An efficient routing algorithm is important for large on-chip networks [network-on-chip (NoC)] to provide the required communication performance to applications. Implementing NoC using table-based switches provide many advantages, including possibility of changing routing algorithms and fault tolerance, due to the option of table reconfigurations. However, table-based switches have been considered unsuitable for NoCs due to their perceived high area and power consumption. In this paper, we describe the region-based routing (RBR) mechanism which groups destinations into network regions allowing an efficient implementation with logic blocks. RBR can also be viewed as a mechanism to reduce the number of entries in routing tables. RBR is general and can be used in conjunction with any adaptive routing algorithm. In particular, we have evaluated the proposed scheme in conjunction with a general routing algorithm, namely segment-based routing (SR) and an Application Specific Routing Algorithm (APSRA) using regular and irregular mesh topologies. Our study shows that the number of entries in the table is significantly reduced, especially for large networks. Evaluation results show that RBR requires only four regions to support several routing algorithms in a 2-D mesh with no performance degradation. Considering link failures, our results indicate that RBR combined with SR is able to tolerate up to 7 link failures in an 8 × 8 mesh. RBR also reduces area and power dissipation of an equivalent table-based implementation by factors of 8 and 10, respectively. Moreover, the degradation in performance of the network is insignificant when using APSRA combined with RBR.