Solving NoC mapping problem with improved particle swarm algorithm

摘要

Network on chip (NoC) mapping problem belongs to quadratic assignment problem, and quadratic assignment problem is a classical combinatorial optimization problem which has been proved to be a NP-complete problem. In this paper, the widely used 2D-mesh as a NoC topology is studied, and the important factors influencing the performance of the system-power consumption and delay are modeled. Then the approximate optimal solution is found using the improved discrete particle swarm optimization algorithm. Simulation experiments show that very good optimal results are obtained.