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. 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.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 2 articles , 1 standard article )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Cai, Yi-Ci; Liu, Bin; Xiong, Yan; Zhou, Qiang; Hong, Xian-Long: Priority-based routing resource assignment considering crosstalk (2006) ioport
  2. Hou, WenTing; Hong, XianLong; Wu, WeiMin; Cai, YiCi: FaSa: A fast and stable quadratic placement algorithm (2003)