A two-stage incremental floorplanning algorithm with boundary constraints

被引:0
作者
Yang, Liu [1 ]
Dong, Sheqin [1 ]
Hong, Xianlong [1 ]
Ma, Yuchun [1 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, EDA Lab, Beijing 100084, Peoples R China
来源
2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS | 2006年
基金
中国国家自然科学基金;
关键词
incremental floorplanning; boundary constraints; slack pash graph(SPG); modute exchange graph(MEG);
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we introduce a two-stage strategy to solve the incremental floorplanning problem with boundary constraints. Firstly, slack push graph(SPG) and module exchange graph(MEG) are built according to the original floorplan. SPG describes the dead spaces between any two adjacent modules and the slack push distance of each module; MEG records the modules which have the same size character. At the first stage, the algorithm aims at boundary constraint satisfaction using two graphs; at the second stage, the algorithm aims at more performance optimization by the aid of MEG. The experimental results of MCNC benchmarks show the effectiveness of our algorithm.
引用
收藏
页码:792 / +
页数:2
相关论文
共 7 条
[1]  
Cong J., 2000, Proceedings International Symposium on Physical Design, 2000. ISPD-2000, P84, DOI 10.1145/332357.332379
[2]  
CRESHAW J, 1999, P IEEE GREAT LAK S V, P248
[3]   Corner block list representation and its application to floorplan optimization [J].
Hong, XL ;
Dong, SQ ;
Huang, G ;
Cai, YC ;
Cheng, CK ;
Gu, J .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2004, 51 (05) :228-233
[4]   Corner block list representation and its application with boundary constraints [J].
Hong, XL ;
Ma, YC ;
Dong, SQ ;
Cai, YC ;
Cheng, CK ;
Gu, J .
SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2004, 47 (01) :1-19
[5]  
LI ZY, 2003, P 5 INT C 21 24 OCT, V1, P178
[6]  
YANG L, 2005, NOVEL INCREMENTAL AL, P241
[7]   Slicing floorplans with boundary constraints [J].
Young, FY ;
Wong, DF ;
Yang, HH .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1999, 18 (09) :1385-1389