国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

Hardware/software partitioning is the key issue of Reconfigurable Instruction Sets Processor (RISP) in hardware/software co-design, what has been proved to be a NP problem. Simulated annealing algorithm (SA) is always the useful method to solve this kind of problems. However, the convergence speed for finding the approximately optimal solution will be slow when the count of tasks become larger. By improving the distance parameter of the perturb model using Cauchy distributing and the annealing schedule, then proposing a more effective boundary condition on the basis of the existing cost function, the speed of convergence will be accelerated. Compared to the classical simulated annealing algorithm, the final experiments indicate that using improved algorithm can significantly accelerate the convergence speed meanwhile increase the ability of finding an approximately optimal solution. 