DocumentCode
2767978
Title
NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm
Author
Lab, M. Daneshta ; Sobhani, A. ; Afzali-Kusha, A. ; Fatemi, O. ; Navabi, Z.
Author_Institution
University of Tehran, Tehran, Iran
fYear
2006
fDate
Sept. 2006
Firstpage
33
Lastpage
38
Abstract
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.
Keywords
Computer networks; Delay; Distributed algorithms; Heuristic algorithms; Minimization methods; Nanoelectronics; Network-on-a-chip; Routing; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Application-specific Systems, Architectures and Processors, 2006. ASAP '06. International Conference on
Conference_Location
Steamboat Springs, CO
ISSN
2160-0511
Print_ISBN
0-7695-2682-9
Type
conf
DOI
10.1109/ASAP.2006.49
Filename
4019488
Link To Document