Design of Bandwidth Aware and Congestion Avoiding Efficient Routing Algorithms for Networks-on-Chip Platforms

In this paper we demonstrate that it is possible to design highly efficient application specific routing algorithms which distribute traffic more uniformly by using information regarding applications communication behavior (communication topology and communication bandwidth). We use off-line analysis to estimate expected load on various links in the network. The result of this analysis is used along with the available routing adaptivity in each router to distribute less traffic to links and paths which are expected to be congested. The methodology for Application Specific Routing Algorithms (APSRA) is extended to incorporate these features to design highly adaptive deadlock free routing algorithms which also distribute traffic more uniformly and reduce network congestion. We show that the number of congested links (links exceeding threshold bandwidth) is reduced by up to 100% with this extension. Significant reduction in average delay is also obtained for both synthetic (up to 25%) as well as a real application (12.5%) communication traffic with this extension to APSRA. We discuss architectural implications and area overhead of our approach on the design of a table based NoC router.

[1]  Vincenzo Catania,et al.  A methodology for design of application specific deadlock-free routing algorithms for NoC systems , 2006, Proceedings of the 4th International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS '06).

[2]  Pedro López,et al.  On the Influence of the Selection Function on the Performance of Networks of Workstations , 2000, ISHPC.

[3]  Ge-Ming Chiu,et al.  The Odd-Even Turn Model for Adaptive Routing , 2000, IEEE Trans. Parallel Distributed Syst..

[4]  Prasant Mohapatra,et al.  A Traffic-Balanced Adaptive Wormhole-Routing Scheme for Two-Dimensional Meshes , 1997, IEEE Trans. Computers.

[5]  Vincenzo Catania,et al.  Multi-objective mapping for mesh-based NoC architectures , 2004, International Conference on Hardware/Software Codesign and System Synthesis, 2004. CODES + ISSS 2004..

[6]  Radu Marculescu,et al.  Traffic analysis for on-chip networks design of multimedia applications , 2002, DAC '02.

[7]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[8]  Vincenzo Catania,et al.  Neighbors-on-Path: A New Selection Strategy for On-Chip Networks , 2006, 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia.

[9]  Lionel M. Ni,et al.  The turn model for adaptive routing , 1998, ISCA '98.

[10]  Radu Marculescu,et al.  DyAD - smart routing for networks-on-chip , 2004, Proceedings. 41st Design Automation Conference, 2004..

[11]  Radu Marculescu,et al.  Energy-aware mapping for tile-based NoC architectures under performance constraints , 2003, ASP-DAC '03.

[12]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[13]  Loren Schwiebert,et al.  Performance Tuning of Adaptive Wormhole Routing through Selection Function Choice , 2002, J. Parallel Distributed Comput..

[14]  Radu Marculescu,et al.  Key research problems in NoC design: a holistic perspective , 2005, 2005 Third IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS'05).

[15]  Kees G. W. Goossens,et al.  A Unified Approach to Mapping and Routing on a Network-on-Chip for Both Best-Effort and Guaranteed Service Traffic , 2007, VLSI Design.

[16]  Erik B. van der Tol,et al.  Mapping of MPEG-4 decoding on a flexible architecture platform , 2001, IS&T/SPIE Electronic Imaging.