A graph theoretic technique to speed up floorplan area optimization

A graph theoretic technique to speed up floorplan area optimization
复制标题

加速平面布局区域优化的图论技术

DOI：
10.1109/dac.1992.227860
复制
发表时间：
1992
期刊：
[1992] Proceedings 29th ACM/IEEE Design Automation Conference
影响因子：
--
通讯作者：
D. F. Wong
D. F. Wong
中科院分区：
--
文献类型：
--
作者：
Ting;D. F. Wong

文献摘要

被引文献

相似文献

作者提出了两种算法来优化选择矩形和L形子平面图的实现。这些算法是专门为T.- C. Wang和D.F. Wong（参见Proc.27th ACM/IEEE Des.自动确认，p.180-6（1990）），但是它们也可以应用于其他算法。实验结果表明，将这两种算法结合到Wang的算法中，其性能得到了很大的提高。对于Wang的算法无法运行的测试运行，该算法有助于产生令人满意的解决方案。&lt;<ETX>&gt;
The authors present two algorithms to optimally select implementations for rectangular and L-shaped subfloorplans. The algorithms are designed specifically for the floorplan optimization algorithm given by T.-C. Wang and D.F. Wong (see Proc. 27th ACM/IEEE Des. Autom. Conf., p.180-6 (1990)), but they can also be applied to other algorithms as well. The experimental results, based on incorporating the two algorithms into Wang's algorithm, whose performance was considerably improved were very encouraging. For the test runs where Wang's algorithm failed to run, the algorithms helped to produce satisfactory solutions.<<ETX>>