FaSa: A fast and stable quadratic placement algorithm

被引：0
|
作者：
WenTing Hou
XianLong Hong
WeiMin Wu
Yici Cai
机构：
[1] Tsinghua University,Department of Computer Science and Technology
来源：
Journal of Computer Science and Technology | 2003年 / 18卷
关键词：
quadratic placement; Lagrange multiplier; incremental LU factorization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：318 / 324
页数：6
相关论文
共 50 条
  • [1] FaSa: A fast and stable quadratic placement algorithm
    Hou, WT
    Hong, XL
    Wu, WM
    Cai, YC
    2002 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS AND WEST SINO EXPOSITION PROCEEDINGS, VOLS 1-4, 2002, : 1391 - 1395
  • [2] FaSa: A fast and stable quadratic placement algorithm
    Hou, WT
    Hong, XL
    Wu, WM
    Cai, YC
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2003, 18 (03) : 318 - 324
  • [3] A fast hierarchical quadratic placement algorithm
    Nam, GJ
    Reda, S
    Alpert, CJ
    Villarrubia, PG
    Kahng, AB
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2006, 25 (04) : 678 - 691
  • [4] FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control
    Viswanathan, Natarajan
    Pan, Min
    Chu, Chris
    PROCEEDINGS OF THE ASP-DAC 2007, 2007, : 135 - +
  • [5] R-DIMENSIONAL QUADRATIC PLACEMENT ALGORITHM
    HALL, KM
    MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03): : 219 - 229
  • [6] Fast Algorithm for the Quadratic Knapsack Problem
    Plotkin, A. V.
    VESTNIK ST PETERSBURG UNIVERSITY-MATHEMATICS, 2022, 55 (01) : 57 - 63
  • [7] Fast Algorithm for the Quadratic Knapsack Problem
    A. V. Plotkin
    Vestnik St. Petersburg University, Mathematics, 2022, 55 : 57 - 63
  • [8] Fast placement algorithm for hierarchical FPGAs
    Dai, Hui
    Zhou, Qiang
    Bian, Jinian
    Zeng, Xiangzhi
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2010, 22 (09): : 1455 - 1462
  • [9] A Fast Discrete Placement Algorithm for FPGAs
    Wu, Qinghong
    McElvain, Kenneth S.
    FPGA 12: PROCEEDINGS OF THE 2012 ACM-SIGDA INTERNATIONAL SYMPOSIUM ON FIELD PROGRAMMABLE GATE ARRAYS, 2012, : 115 - 118
  • [10] A BACKWARD STABLE ALGORITHM FOR QUADRATIC EIGENVALUE PROBLEMS
    Zeng, Linghui
    Su, Yangfeng
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2014, 35 (02) : 499 - 516
12345