DocumentCode
2184170
Title
A New Fair Dynamic Routing Algorithm for Avoiding Hot Spots in NoCs
Author
Daneshtalab, Masoud ; Pedram, Ardavan ; Afzali-Kusha, Ali ; Mohammadi, Siamak
Author_Institution
Nanoelectronics Central of Excellence, Tehran Univ.
fYear
2006
fDate
Oct. 18 2006-Sept. 20 2006
Firstpage
237
Lastpage
241
Abstract
This model takes advantage of output selection based on congestion condition of neighboring switches and input selection based on weighted round robin algorithm which allows packets to be serviced from each input port according to its congestion status that generated by congestion aware routing selection (CARS) module. The proposed algorithm is fair and starvation free. The simulation results show that the proposed algorithm has lower average delays and lower average peak power compared to previously proposed models
Keywords
network-on-chip; telecommunication network routing; congestion aware routing selection; delays; fair dynamic routing algorithm; hot spots; weighted round robin algorithm; Delay; Heuristic algorithms; Nanoelectronics; Network-on-a-chip; Packet switching; Round robin; Routing; Switches; Telecommunication traffic; Tiles;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Information Technologies, 2006. ISCIT '06. International Symposium on
Conference_Location
Bangkok
Print_ISBN
0-7803-9741-X
Electronic_ISBN
0-7803-9741-X
Type
conf
DOI
10.1109/ISCIT.2006.340038
Filename
4141549
Link To Document