Dynamic routing algorithm for avoiding hot spots in on-chip networks

In this paper, we proposed a routing model for distributing hot spots within on-chip networks. It takes advantage of both adaptive minimal path and non-minimal path algorithms. To evaluate the efficiency of the model, a simulator developed using C++ is employed to compare the methods. The simulation results show that in realistic traffic models, like first transpose traffic, and in dense traffics the proposed algorithm has lower average delays compared to the previously proposed models

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

[2]  W. Dally,et al.  Route packets, not wires: on-chip interconnection networks , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[3]  Simon W. Moore,et al.  Low-latency virtual-channel routers for on-chip networks , 2004, Proceedings. 31st Annual International Symposium on Computer Architecture, 2004..

[4]  Sharad Malik,et al.  Orion: a power-performance simulator for interconnection networks , 2002, 35th Annual IEEE/ACM International Symposium on Microarchitecture, 2002. (MICRO-35). Proceedings..

[5]  William J. Dally,et al.  The torus routing chip , 2005, Distributed Computing.

[6]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[7]  Melanie L. Fulgham.  Performance of Chaos and Oblivious Routers Under Non-uniform Traffic , 1993 .

[8]  Sharad Malik,et al.  Orion: a power-performance simulator for interconnection networks , 2002, MICRO.

[9]  Axel Jantsch,et al.  Load distribution with the proximity congestion awareness in a network on chip , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[10]  Russell Tessier,et al.  ASOC: a scalable, single-chip communications architecture , 2000, Proceedings 2000 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00622).

[11]  Kang G. Shin,et al.  Analysis and Implementation of Hybrid Switching , 1995, IEEE Trans. Computers.

[12]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[13]  Suresh Chalasani,et al.  A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

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