A New Fair Dynamic Routing Algorithm for Avoiding Hot Spots in NoCs
2006 (English)In: 2006 International Symposium on Communications and Information Technologies,Vols 1-3, 2006, 237-241 p.Conference paper (Refereed)
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 algorithin 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.
Place, publisher, year, edition, pages
2006. 237-241 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-73468DOI: 10.1109/ISCIT.2006.340038ISI: 000247284400222OAI: oai:DiVA.org:kth-73468DiVA: diva2:488956
International Symposium on Communications and Information Technologies. Bangkok, THAILAND. OCT 18-20, 2006
QC 201203132012-02-022012-02-022012-03-13Bibliographically approved