Association for Computing Machinery
In this paper, the authors propose an effective algorithm flow to handle large-scale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the global level. The flow consists of four steps: the objects in the original netlist are clustered into blocks; floorplanning is performed on the blocks; the blocks are shifted within the chip region to further optimize the wire-length; with big macro locations fixed, incremental placement is applied to place the remaining objects. There are several advantages of handling placement at the global level with a floorplanning technique.