DocumentCode :
3495582
Title :
PARS — An efficient congestion-Aware Routing method for Networks-on-Chip
Author :
Chang, Xin ; Ebrahimi, Masoumeh ; Daneshtalab, Masoud ; Westerlund, Tomi ; Plosila, Juha
Author_Institution :
Dept. of Inf. Technol., Univ. of Turku, Turku, Finland
fYear :
2012
fDate :
2-3 May 2012
Firstpage :
166
Lastpage :
171
Abstract :
The performance of NoCs (Networks-On-Chip) highly relies on the routing algorithm. Despite the higher implementation complexity compared with deterministic routing, adaptive routing has several merits, such as lower latency, higher throughput and better fault-tolerance performance. Most of the existing adaptive routing algorithms are based on the comparison of the horizontal and vertical congestion status in the network. However the performance of adaptive routing schemes suffers from the inadequate global congestion information. To address this issue, we proposed a novel routing algorithm with a congestion aware subnetwork to obtain more accurate non-local congestion information. This subnetwork will propagate the congestion information along the paths directly towards the destination. To find a less congested path, PARS (Path-Aware Routing Scheme) uses the congestion information of paths in a straight direction towards the destination rather than local congestion information. The simulation results reveal that the new presented scheme can offer better performance under different traffic profiles with a small hardware overhead.
Keywords :
deterministic algorithms; network routing; network-on-chip; NoC; PARS; adaptive routing algorithm; congestion aware subnetwork; congestion-aware routing method; deterministic routing algorithm; fault-tolerance performance; global congestion information; network horizontal congestion; network vertical congestion; network-on-chip; nonlocal congestion information; path-aware routing scheme; traffic profiles; Algorithm design and analysis; Network topology; Registers; Routing; System recovery; Topology; Network-on-Chip; congestion awareness; highly adaptiveness; mesh topology; minimal routing algorithm; two-dimensional networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Architecture and Digital Systems (CADS), 2012 16th CSI International Symposium on
Conference_Location :
Shiraz, Fars
Print_ISBN :
978-1-4673-1481-7
Type :
conf
DOI :
10.1109/CADS.2012.6316439
Filename :
6316439
Link To Document :
بازگشت