J4 ›› 2013, Vol. 40 ›› Issue (5): 92-98.doi: 10.3969/j.issn.1001-2400.2013.05.015

• Original Articles • Previous Articles     Next Articles

SoC hardware/software partitioning algorithm for  multi-performance index constraints

CUI Yuanyuan;QIU Xuehong;ZHANG Jianxian;ZHOU Duan   

  1. (School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China)
  • Received:2012-09-10 Online:2013-10-20 Published:2013-11-27
  • Contact: CUI Yuanyuan E-mail:yycui@stu.xidian.edu.cn

Abstract:

A new partitioning algorithm based on adaptive chaotic genetic annealing is proposed to solve the hardware/software partitioning problem of System on Chip (SoC) on the multi-performance index. A new objective function with different proportions of punishment based on multi-constraints is presented in this algorithm which is based on the genetic algorithm. The chaos operation is employed to generate the initial population, and the adaptive mutation operator is adopted. Individuals with poor fitness are optimized by the adaptive chaos strategy as the population individuals which tend to be similar. The optimum individuals upon genetic manipulation are optimized by the annealing strategy. Simulation results suggest that the algorithm can reduce the least power consumption by 9.8% and 4.7% in the case of 200 nodes, and by 5.6% and 4% in the case of 300 nodes, respectively, compared with the simulated annealing algorithm and genetic algorithm.

Key words: system on chip, hardware/software partitioning, adaptive chaos, genetic annealing algorithm