CARM: Congestion Adaptive Routing Method for On Chip Networks

Abstract

Abstract-Network-on-Chip (NoC) has emerged as a longterm and efficient on-chip communication solution for MCSoC and CMP micro-architectures to overcome bottleneck of traditional bus-based interconnects. Performance of NoC is highly dependent on routing algorithm we choose. In this paper, we present a highly adaptive and deadlock free routing algorithm for 2D mesh topology to mitigate congestion. Proposed algorithm provides a high degree of adaptiveness by allowing cycles in channel dependency graph and using one additional virtual channel along the Y dimension only. It uses all available minimal/non-minimal paths between source and destination nodes. A packet is routed along the non-minimal path only when minimal paths get congested at the neighboring nodes. Results show that proposed congestion-aware routing algorithm improves network performance by routing packets through non-congested areas.

An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network

“…In NoC packets could not be discarded because NoC a lossless packet routing is required. As a result, there is a possibility of high-power consumption as well as a sharp efficiency degradation [6].…”