FAME：一个标准单元模式下基于最小割和枚举的快速详细布局算法

随着制造工艺的快速进步，超大规模集成电路的物理设计技术在速度和质量上面临很大挑战。提出了一个快速详细布局算法以适应这种要求，算法继续总体布局得到的单元全局最佳位置，然后采用局部优化将单元精确定位。ＦＭ最小割和局部枚举方法分别用于优化ｙ和ｘ两个方面的连线长度，这两个方向的同一迭代过程中交替进行。另外，采用改进的枚举策略加速算法，对于有障碍和宏模块情况下的布局也加以讨论，实例测试结果表明，ＦＡＭＥ的运

Fame:A Fast Detailed Placement Algorithm for Standard Cell Layout Based on Mixed Mincut and Enumeration

Rapid progress in manufacturing greatly challenges to the VLSI physical design in both speed and performance. A fast detailed placement algorithm, FAME is presented in this paper, according to these demands. It inherits the optimal positions of cells given by a global placer and exact position to each cell by local optimization. FM Mincut heuristic and local enumeration are used to optimize the total wirelength in y and x directions respectively, and a twoway mixed optimizing flow is adopted to combine the two methods for a better performance.Furthermore, a better enumeration strategy is introduced to speed up the algorithm. An extension dealing with blockages in placement has also been discussed. Experimental results show that FAME runs 4 times faster than RITUAL and achieves a 5% short in total wirelength on average.