Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures

In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic routing function such that the total communication energy is minimized. At the same time, the performance of the resulting communication system is guaranteed to satisfy the specified constraints through bandwidth reservation. As the main contribution, we first formulate the problem of energy/performance aware mapping, in a topological sense, and show how the routing flexibility can be exploited to expand the solution space and improve the solution quality. An efficient branch-and-bound algorithm is then described to solve this problem. Experimental results show that the proposed algorithm is very fast, and significant energy savings can be achieved. For instance, for a complex video/audio

• Type: Conference
• Year: 2003
• Where: DATE
• Authors: Jingcao Hu, Radu Marculescu
• Keywords: Algorithm, DATE 2003, Deterministic Routing Function, Efficient Branch-and-bound Algorithm, Hardware