Hardware/Software Partitioning Algorithm Based on Wavelet Mutation Binary Particle Swarm Optimization
Hardware/Software partitioning is a significant problem in RSoC design. Based on a directed acyclic graph (DAG) model, an improved breadth first search algorithm is proposed. The problem is then converted into the constrained 0/1 knapsack problem, and a wavelet mutation binary particle swarm optimization is presented. BPSO parameters of particle are changed in the algorithm, and the current values of the probability are rested on the result of last iteration, the current value of global best position and the private best position. Then, with a certain probability to change the value of particle vector, wavelet mutation is introduced, and an optimal result is reached. Simulations show the algorithm improved the accuracy of the results and achieved an agreeable partitioning.
directed acyclic graph breadth first search Particle Swarm Optimization wavelet mutation
Yuan Jianliang Peng Manman
School of Information Science and Engineering, Hunan University, Changsha 410082, China
国际会议
西安
英文
872-875
2011-05-27（万方平台首次上网日期，不代表论文的发表时间）