Large-scale placement by grid-warping

被引:0
作者
Xiu, Z [1 ]
Ma, JD [1 ]
Fowler, SM [1 ]
Rutenbar, RA [1 ]
机构
[1] Carnegie Mellon Univ, Dept ECE, Pittsburgh, PA 15213 USA
来源
41ST DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2004 | 2004年
关键词
algorithms; placement;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Grid-warping is a new placement algorithm based on a strikingly simple idea: rather than move the gates to optimize their location, we elastically deform a model of the 2-D chip surface on which the gates have been roughly placed, "stretching" it until the gates arrange themselves to our liking. Put simply: we move the grid, not the gates. Deforming the elastic grid is a surprisingly simple, low-dimensional nonlinear optimization, and augments a traditional quadratic formulation. A preliminary implementation, WARP1, is already competitive with most recently published placers, e.g., placements that average 4% better wirelength, 40% faster than GORDIAN-L-DOMINO.
引用
收藏
页码:351 / 356
页数:6
相关论文
共 20 条
[1]  
ALPERT CJ, 1998, P ACM ISPD APR
[2]  
CALDWELL A, 2000, P ACM IEEE DAC JUN
[3]  
CHAN TF, 2000, P ACM IEEE ICCAD NOV
[4]  
CHAN TF, 2003, P ACM IEEE ICCAD NOV
[5]  
CONG J, 2003, COMMUNICATION NOV
[6]  
De Berg M., 2000, COMPUTATIONAL GEOMET, DOI DOI 10.1007/978-3-662-03427-9
[7]  
DOLL K, 1994, P IEEE T CAD, V13
[8]  
EISENMANN H, 1998, P ACM IEEE DAC
[9]  
Flannery B.P., 1992, NUMERICAL RECIPES C
[10]  
FOLWER SM, 2001, THESIS ECE CARNEGIEM