Ant colony based routing architecture for minimizing hot spots in NOCs

M Daneshtalab, AA Kusha, A Sobhani… - Proceedings of the 19th …, 2006 - dl.acm.org
Proceedings of the 19th annual symposium on Integrated circuits and systems …, 2006dl.acm.org
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 …
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.
ACM Digital Library
以上显示的是最相近的搜索结果。 查看全部搜索结果