Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Sechen C, Lee K W. An improved simulated annealing algorithm for row-based placement. InProc. the IEEE Int. Conf. Computer-Aided Design, San Jose, CA, USA, 1987, pp.478–481.
Wang M, Yang X, Sarrafzadeh M. Dragon 2000: Standard-cell placement tool for large industry circuits InProc. the IEEE Int. Conf. Computer-Aided Design, IEEE, Nov., San Jose CA, USA, 2000, pp.260–263.
Tang Pushan. The Theory and Method of Computer Aided Design.Press of Fu Dan University, May, 1990.
Kleinhans J M, Sigl G, Johannos F M, Antreich K J. GORDIAN: VLSI placement by quadratic programming and slicing optimization.IEEE Trans. CAD, 1991, CAD-10(3): 356–365.
Srinivasan A, Chaudhary K, Kuh E. S.. RITUAL: A performance-driven placement algorithm.IEEE Trans. CAS-II: Analog and Digital Processing, 1992, 39(11): 825–840.
Kong Tianming, Hong XianLong, Qiao Changge. VEAP: A global optimization based placement algorithm for standard cell design. InProc. the Asia and South Pacific Design Automation Conference'97, Japan Jan., 1997, pp.277–281.
Yu Hong, Hong Xianlong, Qiao Changge, Cai Yici. CASH: A novel quadratic placement algorithm for very large standard cell layout design based on clustering. InProc. the 5th Int. Conf. Solid-State and Integrated Circuit Technology, Beijing, China, 1998, pp.496–501.
Fletcher R. Practical Methods of Optimization. John Wiley & Sons, Ltd. 1981.
http://www.netlib.org/scalapack/prototype/
Joseph W H Liu. Modification of the minimum degree algorithm by multiple elimination.ACM Trans. Math. Software, 1985, (11): 141–153.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China (Grant No.60121120706), NSF of USA (Grant No.CCR-0096383), and the National Hi-Tech R&D 863 Program of China (Grant No.2002AA1Z1460).
HOU WenTing got her B.S. degree from Xi'an Jiaotong University in 1998. And now she is a Ph.D. candidate in Department of Computer Science and Technology in Tsinghua University her research interest liest in VLSI physical design, especial placement algorithm.
HONG XianLong is a professor in Department of Computer Science and Technology in Tsinghua University. He is a senior member of IEEE. His research interest lies in Electronic Design Automation, especial VLSI physical design.
WU WeiMin is an associate professor in Department of COmputer Science and Technology in Tsinghua University. His research interest lies in VLSi high level synthesis and physical design.
CAI YiCi is an associate professor in Department of Computer Science and Technology in Tsinghua University. She focuses in VLSI physical design research and teaching.
Rights and permissions
About this article
Cite this article
Hou, W., Hong, X., Wu, W. et al. FaSa: A fast and stable quadratic placement algorithm. J. Comput. Sci. & Technol. 18, 318–324 (2003). https://doi.org/10.1007/BF02948901
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948901