Hardware/software partitioning based on greedy algorithm and simulated annealing algorithm
Tao Li · Journal of Computer Applications · 2013
Hardware/Software(HW/SW) partitioning is one of the crucial steps in the co-design of embedded system,and it has been proven to be a NP problem.Considering that the latest work has slow convergence speed and poor solution quality,the authors proposed a HW/SW partitioning method based on greedy algorithm and Simulated Annealing(SA) algorithm.This method reduced the HW/SW partitioning problem to the extended 0-1 knapsack problem,and used the greedy algorithm to do the initial rapid partition;then divided the solution space reasonably and designed a new cost function and used the improved SA algorithm to search for the global optimal solution.Compared to the existing improved algorithms,the experimental results show that the new algorithm is more effective and practical in terms of the quality of partitioning and the running time,and the promotion proportions are 8% and 17% respectively.