Corner block list: An effective and efficient topological representation of non-slicing floorplan

被引:204
作者
Hong, XL [1 ]
Huang, G [1 ]
Cai, YC [1 ]
Gu, JC [1 ]
Dong, SQ [1 ]
Cheng, CK [1 ]
Gu, J [1 ]
机构
[1] Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
来源
ICCAD - 2000 : IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN | 2000年
关键词
D O I
10.1109/ICCAD.2000.896442
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a corner block list - a new efficient topological representation for non-slicing floorplan is proposed with applications to VLSI floorplan and building block placement. Given a corner block list, it takes only linear time to construct the floorplan. Unlike the O-tree structure, which determines the exact floorplan based on given block sizes, corner block list defines the floorplan independent of the block sizes. Thus, the structure is better suited for floorplan optimization with various size configurations of each block Based on this new structure and the simulated annealing technique, an efficient floorplan algorithm is given. Soft blocks and the aspect ratio of the chip are taken into account in the simulated annealing process. The experimental results demonstrate the algorithm is quite promising.
引用
收藏
页码:8 / 12
页数:5
相关论文
共 7 条
[1]  
GUO PN, ACM IEEE DES AUT C 1
[2]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[3]  
Murata H., 1995, P ICCAD, P472
[4]  
ONODERA H, 1991, P 28 ACM IEEE DES AU, P423
[5]  
TAHAHASHI T, 1996, ALGORITHM FINDIN VLD, V96, P31
[6]  
WONG DF, 1986, P 23 ACM IEEE DES AU, P101
[7]  
[No title captured]