论文部分内容阅读
本文提出一种适合于门阵列的布局算法,该算法采用分析方法处理二次分配的组合问题,具体使用最优相对布局及线性分配定位或快速定位方法得到一个接近最优解.实际结果表明不论初始分布如何,均可在差不多相同的时间内获得优化结果大致相同的结果. 本算法(用快速定位)的计算复杂性为O(n),计算速度很快,一般对一百至二百个单元的芯片,计算速度比通常的力交换法快一个数量级.本算法对大系统的适应性特别好.
This paper presents a layout algorithm suitable for gate array, which uses analytic method to deal with the combination problem of quadratic assignment, and uses the optimal relative layout and linear assignment locating or fast locating method to get a near optimal solution. The actual results show that no matter The initial distribution of the same results can be obtained at about the same time the results of the optimization results of the algorithm (with rapid positioning) computational complexity of O (n), the calculation speed is very fast, usually one hundred to two hundred Unit of the chip, the calculation speed than the usual force exchange method an order of magnitude. The adaptability of this algorithm is particularly good for large systems.