A fast algorithm for energy-aware mapping of cores onto WK-recursive NoC under performance constraints

Network on Chip (NoC) has been proposed as a new paradigm for designing System on Chip which supports high degree of scalability and reusability. Mapping an application, which is described by a parameterized task graph, onto NoC is a key research problem in NoC design. In this paper, we first propose an energy-aware cores mapping approach on WK-recursive NoC, and then present a fast clustering-based scheduling algorithm that maps the cores onto WK-recursive NoC architecture under bandwidth constraints to minimize the total communication energy. Experimental results show that the proposed algorithm is able to handle large task graphs and provide near optimal cores mapping in a few seconds on a PC platform.