Low Energy Mapping for Tree Based Networks-on-Chip

A recursive bipartitioning algorithm, RPM, is proposed for low energy mapping in tree-based Network-on-Chip (NoC) architectures subject to communication latency constraints. The mapping problem is formulated to multi-level IP core communication task graph partitioning problems, and the modified Kernighan-Lin mincut heuristic is used to solve them. Experimental results show that RPM obtains lower energy mapping solutions compared with existing algorithms.