FaSa: a fast and stable quadratic placement algorithm

Authors:
WenTing Hou;Xian Long Hong;WeiMin Wu;YiCi Cai
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2003

Citing 3
Cited 2

Practical methods of optimization; (2nd ed.)

Practical methods of optimization; (2nd ed.)
Modification of the minimum-degree algorithm by multiple elimination

ACM Transactions on Mathematical Software (TOMS)
Dragon2000: standard-cell placement tool for large industry circuits

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design

An efficient quadratic placement based on search space traversing technology

Integration, the VLSI Journal
Priority-based routing resource assignment considering crosstalk

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

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.