Improving Placement under the Constant Delay Model

In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently computed once in advance and still accurately reflect the circuit area throughout the placement process. The existence of an efficient and accurate cost function allows us to directly optimize circuit area. This leads to better results compared to heuristic edge weight estimates or optimization for secondary criteria such as wire length. We leverage this property to improve a recursive partitioning based tool flow. We achieve area savings of 27% for some circuits and 15% on average. The use of the constant delay model additionally enables timing closure without iterations.

• Type: Conference
• Year: 2002
• Where: DATE
• Authors: Kolja Sulimma, Wolfgang Kunz, Ingmar Neumann, Lukas VanGinneken
• Keywords: Circuit Area, Constant Delay Model, DATE 2002, Hardware, Wire Length