关键词: 片上网络, 规则Mesh, 任务映射, 低功耗, 通信代价

Abstract: This paper presents an efficient algorithm to solve a mapping problem of the Network on Chip(NoC) regular architecture under low power constraints. According to symmetry of the regular topological structure, the algorithm only keeps one equivalent optimal solution for the first core mapping result. Then combining with the pruning principle of branch and bound algorithm, the algorithm mappings the rest cores. Thus the algorithm reduces the search space, speeds up the convergence rate and reduces the operating time. Experimental results show that the algorithm has lower communication cost and short run time.

Key words: Network on Chip(NoC), regular Mesh, task mapping, low power consumption, communication cost