A new congestion-aware routing algorithm in network-on-chip: 2D and 3D comparison

• Published in: International journal of computers & applications Vol. 45; no. 1; pp. 27 - 35
• Main Authors: Gaffour, K., Benhaoua, M. K., Benyamina, A. H., Zahaf, H. E.
• Format: Journal Article
• Language: English
• Published: Calgary Taylor & Francis 02.01.2023; Taylor & Francis Ltd; ACTA Press
• Subjects: 2D topology; 3D topology; Algorithms; Communication; Computer Science; Congestion; congestion control; Embedded Systems; Finite element method; Hardware Architecture; Modular structures; Network latency; Network topologies; Network-on-Chip; Networking and Internet Architecture; Power consumption; Routers; Routing (telecommunications); routing algorithms; System on chip
• ISSN: 1206-212X; 1925-7074
• DOI: 10.1080/1206212X.2019.1679529

Network on-Chip (NoC) is scalable, flexible, modular communication structure for Multi/Many-core architectures. It allows simpler interconnect models with higher bandwidth compared to bus-based architectures. When a message is exchanged inside an NoC, it passes through several routers. When the communication load is high, contention and congestion may appear in central routers, and lead to an increased latency and power consumption. 3D NoC has been proposed as a solution to improve the performances, especially: throughput, latency, and energy efficiency. In this paper, we first report the results of theoretical and practical comparison between 2D and 3D mesh Network-on-Chip topology. We focus on communication supports, especially routing, in the goal of reducing latency and avoiding congestion. Further, we propose a novel exhaustive routing algorithm to avoid and reduce congestion in 2D and 3D NoC. Also, we discuss the implementation of the proposed algorithm in both topologies and the trade-off between their overheads and their performances. We demonstrate the effectiveness of our algorithm using a wide set of synthetic experiments using NOXIM simulator.