A weighted minimal fully adaptive congestion aware routing algorithm for Network on Chip
Habib Chawki Touati, Fateh Boutekkouk · 2017
One of the commonly known issues that contribute to performance degradation in on-chip communication is congestion, by stalling data packets and increasing average latency. The most efficient way to limit its effect is through the implementation of a reliable congestion aware routing scheme, that helps select the less congested routes for packet transmission. In this paper, a novel weighted minimal fully adaptive congestion aware routing algorithm for network on chip is presented. Instead of leveraging congestion-related information along each dimension separately, the proposed scheme investigates congestion along both dimensions at once, and offers a compromise between locally and globally aware routing in mesh-based NoC. Experimental results show that the proposed algorithm outperforms its peers with regard to average network latency and throughput.