MCAR: Non-local adaptive Network-on-Chip routing with message propagation of congestion information |
| |
| Affiliation: | 1. State Key Laboratory of Wide Bandgap Semiconductor Technology Disciplines, Xidian University, Xi''an 710071, China;2. Institute of Natural Resources Environment and Historical Culture, Xianyang Normal University, Xianyang 712000, China;1. Chair of Technical Electronics, Technical University of Munich (TUM), Germany;2. Chair of Electronic Design Automation, Technical University of Munich (TUM), Germany;1. School of Electronic Engineering, Sudan University of Science and Technology, Khartoum, Sudan;2. School of Electrical and Electronic Engineering, Universiti Sains Malaysia, Nibong Tebal 14300, Penang, Malaysia;1. Advanced Analog Systems Chair, CentraleSupélec, 3 Rue Joliot Curie, F-91192 Gif-Sur-Yvette Cedex, France;2. Group of Electrical Engineering Paris, UMR CNRS 8507, CentraleSupélec, Univ. Paris-Sud, Univ. Paris-Saclay, Sorbonne Univ., UPMC Univ Paris 06, F-91192 Gif-Sur-Yvette Cedex, France;3. 31 Boulevard Dolez, 7000 Mons, Belgium;1. Beijing Advanced Innovation Center for Imaging Technology, China;2. College of Computer Science and Software Engineering, Shenzhen University, China;3. College of Information Engineering, Capital Normal University, China;4. Embedded Systems and CPS Laboratory, Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China;1. Madeira Interactive Technologies Institute, Funchal, Portugal;2. University of Madeira, Funchal, Portugal;3. University of Las Palmas de Gran Canaria, Las Palmas de Gran Canaria, Spain;1. Department of Electrical and Computer Engineering, University of Pittsburgh, Pittsburgh, USA;2. Department of Computer Science, University of Pittsburgh, Pittsburgh, USA |
| |
| Abstract: | Congestion occurs frequently in Networks-on-Chip (NoC) when the packet demands exceed the capacity of network resources. Non-local adaptive routing algorithms utilize the congestion information of both local and distant links to decide the output link selection, which can greatly improve the network performance. The existing non-local adaptive routing algorithms have two mechanisms to propagate the congestion information of distant links. One of mechanism is to increase additional wires/clusters. The other mechanism is to embed the propagated information in packet headers. This paper proposes a new non-local adaptive routing algorithm called MCAR. In MCAR, two special kinds of messages are used to propagate the congestion information of distant links across the network without introducing additional wires/clusters and leading to a better timeliness of congestion information. Moreover, MCAR efficiently utilizes the propagated information to decide the output link selection. Experimental results on both synthetic traffic patterns and application traces show that MCAR achieves better saturation throughput (5.84% on average) and smaller power consumption (7.58% on average) than a state-of-the-art adaptive routing algorithm. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
