An enhanced Q-sequence augmented with empty-room-insertion and parenthesis trees

An enhanced Q-sequence augmented with empty-room-insertion and parenthesis trees
复制标题

DOI:
10.1109/date.2002.998250
复制
发表时间:
2002-03
期刊:
Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition
影响因子:
--
通讯作者:
Changwen Zhuang;Y. Kajitani;K. Sakanushi;Liyan Jin
Changwen Zhuang;Y. Kajitani;K. Sakanushi;Liyan Jin
中科院分区:
其他
文献类型:
--
作者:
Changwen Zhuang;Y. Kajitani;K. Sakanushi;Liyan Jin

文献摘要

被引文献

相似文献

在讨论了VLSI布局设计中布局规划与布局布局算法的区别后,本文将基于Q序列的布局规划算法应用到布局布局算法中。为此,需要插入一些空房间,以保证不会错过最佳包装。为了提高布局的性能,引入了一个新的移动,扰乱布局的括号树对。实现了一种基于模拟退火的装箱搜索算法。实验结果显示了空房间插入的效果。
After the discussion on the difference between floorplanning and packing in VLSI placement design, this paper adapts the floorplanner that is based on the Q-sequence to a packing algorithm. For the purpose, some empty room insertion is required to guarantee not to miss the optimum packing. To increase the performance in packing, a new move that perturbs the floorplan is introduced in terms of the parenthesis-tree pair. A simulated annealing based packing search algorithm was implemented. Experimental results showed the effect of empty room insertion.