An Improved Simulated Annealing Algorithm With Excessive Length Penalty for Fixed-Outline Floorplanning.

IEEE ACCESS(2020)

引用 12|浏览28
暂无评分
摘要
In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which optimizes the area, the total wirelength, and the prescribed outline constraints at the same time. In order to enhance the effectiveness of SA algorithm, we propose a novel feasible solution strategy which ensures that viable solution would be found at all times. Moreover, we propose a new penalty function to better solve the prescribed outline constraint. It consists of a violation area function to prevent modules from moving to the prescribed outline, and an excessive violation function to enable the modules to move close to the optimal positions. Experimental results show that the proposed algorithm is effective and efficient to obtain a fixed-outline floorplan, and achieves a 100% success rate on each benchmark in different aspect ratios.
更多
查看译文
关键词
Simulated annealing,Estimation,Heuristic algorithms,Cost function,Clustering algorithms,Licenses,Perturbation methods,Floorplanning,fixed-outline,simulated annealing algorithm,excessive violation function,feasible solution strategy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要