FaSa: A fast and stable quadratic placement algorithm

Placement is a critical step in VLSI design because it dominates overall speed and quality of design flow. In this paper, a new fast and stable placement algorithm called FaSa is proposed. It uses quadratic programming model and Lagrange multiplier method to solve placement problems. And an incremental LU factorization method is used to solve equations for speeding up. The experimental results show that FaSa is very stable, much faster than previous algorithms and its total wire length is comparable with other algorithms.

[1]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[3]  Hong Yu,et al.  CASH: a novel quadratic placement algorithm for very large standard cell layout design based on clustering , 1998, 1998 5th International Conference on Solid-State and Integrated Circuit Technology. Proceedings (Cat. No.98EX105).

[4]  Kamal Chaudhary,et al.  RITUAL: a performance driven placement algorithm , 1992 .

[5]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[6]  Majid Sarrafzadeh,et al.  Dragon2000: standard-cell placement tool for large industry circuits , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[7]  Carl Sechen,et al.  IMPROVED SIMULATED ANNEALING ALGORIHM FOR ROW-BASED PLACEMENT. , 1987 .

[8]  Hong Xianlong,et al.  VEAP: Global optimization based efficient algorithm for VLSI placement , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.