Abstract:

An adaptive chaos genetic annealing algorithm is proposed to solve the mapping problem of lowenergy consumption networkonchip (NoC) subject to the constraints of bandwidth and communication latency. Based on Boltzmann update mechanism, the algorithm makes a selection of genetic individuals. Individuals with poor fitness are optimized by the adaptive chaos method, while the optimum individuals are optimized by the strategy of multineighborhood annealing. Experiments suggest that the proposed algorithm is able to avoid premature convergence and increase the convergence speed. Compared with the standard genetic algorithm and the chaos genetic algorithm, 45% and 226% energy savings are achieved on average, respectively, thus effectively reducing the energy consumption of NoC system communications.

Key words: networkonchip, mapping algorithm, lowenergy consumption, adaptive chaos, genetic annealing