Encircle routing: An efficient deterministic network on chip routing algorithm
Shylesh Umapathy, Meet K. Shah, Nan Wang · 2018
In the current era, with technology scaling heading towards deeper submicron, system-on-chip designs have traversed from basic CISC and RISC architectures to intricated multi-core systems with higher communication requirements. Network-on-chip architectures dawned as a favorable solution for the forthcoming system-on-chip communication architecture designs, having said that, the routing algorithms of the network-on-chip architecture are confronted with great challenges. To address the shortcomings of the current routing algorithms, a new deterministic routing algorithm: Encircle routing is proposed in this paper. In the proposed algorithm, the traffic heap is deflected from the center of the network and distributed to the entire network, which in turn helps to improve the overall system performance. Simulation of the proposed Encircle routing algorithm and two existing routing algorithms has been carried out using NIRGAM simulator. Simulation results indicate that the performance of the Encircle routing algorithm surpasses the performance of existing algorithms in terms of lowering the congestion at the center of the network and improving average latency.