%0 Journal Article
%T FaSa: A Fast and Stable Quadratic Placement Algorithm
%A WenTing Hou
%A XianLong Hong
%A WeiMin Wu
%A Yici Cai
%A <br>侯文婷
%A 洪先龙
%A 吴为民
%A 蔡懿慈
%J 计算机科学技术学报
%D 2003
%I 
%X 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.
%K quadratic placement
%K Lagrange multiplier
%K incremental LU factorization<br>二次布局
%K 拉格朗日乘子
%K 增量负载单元因子分解
%K VLSI
%K 超大规模集成电路
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=017B45AE109D43DBF99A222F4C1B157E&yid=D43C4A19B2EE3C0A&vid=13553B2D12F347E8&iid=38B194292C032A66&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=4&reference_num=10