Reliable Weighted Globally Congestion Aware Routing for Network on Chip

Abstract

With the ability to incorporate hundreds of communicating cores on a single chip, thanks to the continuous shrinkage in sizes, communication became of the utmost importance. Consequently, the reduction of transmission delays became unavoidably necessary. All of which is achieved by means of routing algorithms, responsible for selecting the most appropriate routes for data packets, by avoiding congested regions in the network between any pair of source and destination nodes. In this article, two moderately distinct versions in terms of weight distribution of a minimal, fully adaptive, congestion-aware routing scheme in mesh-based network on chip and its accompanying congestion propagation network, are presented. The algorithm does not rely solely on local congestion information nor on irrelevant global information, and provides somewhat a compromise between locally and globally aware routing. The experimental results showcase the proposed scheme's superiority over state of the art NoC routing algorithms.