loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)
NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm
Steamboat Springs, Colorado, USA
September 11-September 13
ISBN: 0-7695-2682-9
M. Daneshtalab, University of Tehran, Tehran, Iran
A. Sobhani, University of Tehran, Tehran, Iran
A. Afzali-Kusha, University of Tehran, Tehran, Iran
O. Fatemi, University of Tehran, Tehran, Iran
Z. Navabi, Northeastern University, Boston, U.S.A.
In this paper, a routing model for minimizing hot spots in the network on chip (NOC) is presented. The model makes use of AntNet routing algorithm which is based on Ant colony. Using this algorithm, which we call AntNet routing algorithm, heavy packet traffics are distributed on the chip minimizing the occurrence of hot spots. To evaluate the efficiency of the scheme, the proposed algorithm was compared to the XY, Odd- Even, and DyAD routing models. The simulation results show that in realistic (Transpose) traffic as well as in heavy packet traffic, the proposed model has less average delay and peak power compared to the other routing models. In addition, the maximum temperature in the proposed algorithm is less than those of the other routing algorithms.
Citation:
M. Daneshtalab, A. Sobhani, A. Afzali-Kusha, O. Fatemi, Z. Navabi, "NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm," asap, pp.33-38, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.