POS:使用一维种子的单元布局算法

提出了一种基于一对一维布局结果使用边界种子的布局算法POS.该算法有以下特点:(1)能精确估计总连线长度的简单新颖的线性目标函数.(2)定义了边界单元和内部单元.(3)根据两个邻接的边界单元应具有最短连线长度来排序边界单元.(4)基于左边和底边边界单元的两方向种子布局.(5)用一对一维布局结果来构造二维布局结果.实验结果表明,当布局规模很大时POS算法是模拟退火算法总连线长度的40%,运行时间的0.02%,说明POS算法比模拟退火算法更快更有效率.

POS: A CELL PLACEMENT USING ONE-DIMENSIONAL SEED

In this paper we proposed POS, a cell placement based on pair of one-dimensional placement using boundary-seed placement. We contribute following(1)A novel and simple linear objective function for accurately estimating total wire-length. (2)Defined boundary cells and internal cells. (3)Sorting boundary cells by two neighbor boundary cells should have minimum wire-length (shortest length path). (4)Two directions seed placement based on left and bottom boundary cells. (5)To get two-dimensional placement solution using the results of pair of one-dimensional placement. Experimental results show POS achieved 40% better and 5 000 times solutions on average than simulated annealing, I.e. POS can be more effective and faster when the placement problem size becomes larger.