A new partitioning approach for very large circuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that prots from a linear objective function, signicantly improves the partitioning quality compared to the well-known eigenvector approach, which minimizes a quadratic objective function. For the rst time, results of benchmark circuits with up to 100,000 cells are presented. The cutsize and the minimum ratio cut is improved up to 90%. The average improvement is about 50%.

No abstract

No abstract

No abstract

In this paper, we present a new approach that performs timing driven placement for standard cell circuits in interaction with netlist transformations.As netlist transformations are integrated into the placement process, an accurate net delay model is available. This model provides the basis for effective netlist transformations.In contrast to previous approaches that apply netlist transformations during placement, we are not restricted to local transformations like fanout buffering or gate resizing. Instead, we exploit global dependencies between the signals in the circuit. Results for benchmark circuits show excellent placement quality. The maximum path delay is reduced up to 33 % compared to the initial timing driven placement of the original netlist and up to 18 % compared to the results obtained by consecutive optimization of the netlist and timing driven placement of the optimized netlist. This delay reduction is achieved with almost no increase in chip area. 1.