An algorithm for quadrisection and its application to standard cell placement

An efficient heuristic for hypergraph quadrisection is presented. A placement technique for standard cells based on quadrisection is also discussed in detail. Results show this method to be much superior to min-cut bisection, yielding improvements of up to 20% in area. It also compares favorably with simulated annealing, yielding improvements in area for most of the circuits under test. The placer runs about 100 times faster than a simulated-annealing based placement package. >

[1]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[2]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[3]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.

[4]  Sungho Kang,et al.  Linear Ordering and Application to Placement , 1983, 20th Design Automation Conference Proceedings.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  A. Sangiovanni-Vincentelli,et al.  The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.

[8]  Mark R. Hartoog.  Analysis of Placement Procedures for VLSI Standard Cell Layout , 1986, DAC 1986.