Fame: A fast detailed placement algorithm for standard-cell layout based on mixed mincut and enumeration

Rapid progress in manufacturing burdens great challenges on VLSI physical design both in speed and performance. This paper presents a fast detailed placement algorithm, FAME, according to these demands. It inherits the optimal positions of cells given by a global placer and allocates exact position to each cell using local optimization. FM Mincut and local enumeration are used for optimizing the total wirelength respectively in y and x directions, and a two way mixed optimize flow are adopted to combine the two methods for a better performance. Furthermore, a better enumeration strategy is introduced to speed up the algorithm. An extension to deal with blockages in placement is also discussed. Experimental results show that FAME runs 4 times faster than RITUAL and achieves 5 percent shorter in total wire length on average.