Sciweavers

31
Voted
ASAP
2006
IEEE

NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm

14 years 26 days ago
NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm
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, OddEven, 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.
Masoud Daneshtalab, Ashkan Sobhani, Ali Afzali-Kus
Added 13 Oct 2010
Updated 13 Oct 2010
Type Conference
Year 2006
Where ASAP
Authors Masoud Daneshtalab, Ashkan Sobhani, Ali Afzali-Kusha, Omid Fatemi, Zainalabedin Navabi
Comments (0)