A Performance Constrained Metaheuristic Algorithm for 2D Mesh Based NoC

Abstract

Integrating large number of Intellectual Property (IP) cores onto a single chip has been made possible with the technology scaling and shrinking in the size of transistors. This has led designers to create a scalable and flexible on-chip network infrastructure – Network on Chip (NoC). Mapping application graphs on multiple cores of NoC architecture is one of the challenging research problems. The all in all performance of NoC network depends primarily on an efficient and cost-effective mapping technique which optimizes several performance metrics. These metrics primarily consists of communication cost, energy, throughput, latency, power dissipation and simulation time. A metaheuristic state-of-the-art nature inspired mapping approach for NoC's called Hunger Games Search Algorithm (HGSA) has been introduced in this research work. The devised algorithm minimizes NoC energy and power consumption based on six standard available embedded application benchmarks. Experimental results demonstrate that the presented technique outperforms as compared to other existing nature-inspired meta-heuristic application mapping approaches.