期刊文献+

一种有效的面向软模块的VLSI布图规划算法 被引量:1

HUANG Cheng, et al. Efficient VLSI floorplanning algorithm targeting soft modules
在线阅读 下载PDF
导出
摘要 随着VLSI设计规模和复杂度的提高,以可复用IP为代表的软模块得到了广泛的应用,针对软模块的布图规划问题随之变得日益重要。基于正则波兰表达式(NPE)表示,提出了一种形状曲线相加算法来处理软模块之间的组合运算,可获得每个布图解下最优的布图实现。通过回溯算法来确定每个模块的位置及形状,并将它们集成到模拟退火算法的流程之内。应用MCNC和GSRC电路对算法进行了测试,结果表明该算法解决软模块的布图规划问题是可行和有效的。 With the rapid increase of VLSI circuit size and complexity, soft modules represented by reusable IP cores are widely used in VLSI design, which makes floorplanning problem with soft modules increasingly important. A shape curve adding algorithm is proposed to deal with the combination of pairs of soft modules and by which we can obtain the best flooplan implementation for any slicing structure floorplan solution. A backtracking algorithm is employed to determine the shape and position of each module. Both of them are integrated into the framework of simulated annealing algorithm. The algorithm is tested on the MCNC and GSRC benchmarks and experimental results indicate that compared with the related works, the proposed algorithm is effective and efficient to solve the floorplaning problem with soft modules.
出处 《计算机工程与应用》 CSCD 2014年第4期50-56,68,共8页 Computer Engineering and Applications
基金 国家自然科学基金(No.61131001 No.61041001) 浙江省自然科学基金(No.Z1090622) 浙江省教育厅科研项目(No.Y201016754) 宁波市自然科学基金(No.2013A610003) 宁波大学科研项目(No.XYL13002)
关键词 布图规划 软模块 形状曲线相加 回溯 模拟退火算法 floorplanning soft module shape curve adding backtracking simulated annealing
  • 相关文献

参考文献14

  • 1徐宁,洪先龙,董社勤.BBL布局算法研究[J].计算机辅助设计与图形学学报,2004,16(9):1216-1219. 被引量:5
  • 2王琳凯,赵长虹,陈珊珊,周晓方.一种考虑集中约束的平面布图规划算法[J].小型微型计算机系统,2010,31(4):726-730. 被引量:1
  • 3Chrzanowska-Jesk M, Greenwood G,Wang B.Combining evolution strategies with lagrangian relaxation for con-structing nonslicing VLSI floorplans with soft modules[C]// Proceedings of the 2002 Congress on Evolutionary Compu- tation, Hawaii, USA, 2002 : 1261 - 1266.
  • 4Lin C, Zhou H, Chu C.A Revisit to floorplan optimization by lagrangian relaxation[C]//2006 International Conference on Computer-Aided Design, San Jose, USA, 2006: 164-171.
  • 5Young F Y,Chu C C N,Luk W S,et al.Floorplan area minimization using lagrangian relaxtion[C]//Proceedings of the 2000 International Symposium on Physical Design, San Diego,USA,2000- 174-179.
  • 6Hiroaki I, Chikaaki K, Kunihiro F.A graph based soft module handling in floorplan[J].IEICE Transactions on Funda- mentals of Electronics, Communications and Computer Sciences, 2005,88-A(12) : 3390-3397.
  • 7Young F Y,Chu C C N,Luk W S,et al.Handling soft modules in general non-slicing floorplan using lagrangian relaxation[J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2001,20(5) : 687-692.
  • 8Wang Jia, Zhou Hai.Linear constraint graph for floorplan optimization with soft blocks[C]//IEEE/ACM International Conference on Computer-Aided Design, San Jose, Cali- fornia, USA, 2008: 9-15.
  • 9Lin Jai-Ming, Hung Zhi-Xiong.SKB-Tree: a fixed-outline driven representation for modern floorplanning problems[J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2012,20(3 ) : 473-484.
  • 10Yan J Z, Chu C.DeFer: deferred decision making enabled fixed-outline floorplanning algorithm[J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2010,29 ( 3 ) : 367-381.

二级参考文献12

  • 1徐宁,洪先龙,董社勤.BBL布局算法研究[J].计算机辅助设计与图形学学报,2004,16(9):1216-1219. 被引量:5
  • 2徐宁,洪先龙,陈松,董社勤.热约束的BBL布局算法研究[J].计算机辅助设计与图形学学报,2005,17(6):1312-1315. 被引量:6
  • 3Hong Xianlong, Huang Gang, Cai Yici, et al. Corner block list: An effective and efficient topological representation of non-slicing floorplan[A]. In: Proceedings of IEEE/ACM International Conference on Computer Aided Design, San Jose, 2000. 8~12
  • 4Guo P N, Cheng C K. An o-tree representation of non-slicing floorplan and its applications[A]. In: Proceedings of the 36th Conference on Design Automation, New Orleans, 1999. 268~273
  • 5Guo Peining, Toshihiko Takahashi, Cheng Chungkuan, et al. Floorplanning using a tree representation[J]. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 2001, 20(2): 281~289
  • 6Chang Y -C, Chang Y -W, G -M, et al. B*-trees: A new representation for non slicing floorplans[A]. In: Proceedings of IEEE/ACM International Conference on Computer Aided Design, San Jose, 2000. 458~463
  • 7Glover F. Tabu search-part I[J]. Operations Research Society of America Journal on Computing, 1989, 1(3): 190~206
  • 8Glover F. Tabu search-part II[J]. Operations Research Society of America Journal on Computing, 1990, 2(1): 4~32
  • 9Murata H, Fujiyoshi K, Nakatake S, et al. Rectangle packing-based module placement[A]. In: Proceedings of IEEE/ACM International Conference on Computer Aided Design, San Jose, 1995. 472~479
  • 10Murata H, Fujiyoshi K, Nakatake S, et al. VLSI module placement based on rectangle-packing by the sequence pair[J]. IEEE Transactions on Computer Aided Design, 1996, 15(12): 1518~1524

共引文献4

同被引文献12

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部