NRG: global and detailed placement

We present a new approach to the placement problem. The proposed approach consists of analyzing the input circuit and deciding on a two-dimensional global grid for that particular input. After determination of the grid size, the placement is carried out in three steps: globalplacement, detailed placement, and nal optimization. We will show that the output of the global placement can also serve as a fast and accurate predictor. Current implementation is based on simulated annealing. We have put all algorithms together in a placement package called NRG (pronounced N-er-G). In addition to area minimization, NRG can perform timing-driven placement. Experimental results are strong. We im

• Type: Conference
• Year: 1997
• Where: ICCAD
• Authors: Majid Sarrafzadeh, Maogang Wang
• Keywords: Global Placement, Hardware, ICCAD 1997, Placement Problem, Two-dimensional Global Grid