排序方式: 共有16条查询结果,搜索用时 109 毫秒
1.
2.
Deterministic VLSI block placement algorithm using Less Flexibility First principle 总被引:1,自引:0,他引:1 下载免费PDF全文
In this paper,a simple while effective deterministic algorithm for solving the VLSI block placement problem is proposed considering the packing area and interconnect wiring simultaneously.The algorithm is based on a principle inspired by observations of ancient professionals in solving their similar problems.Using the so-called Less Flexibility First principle,it is tried to pack blocks with the least packing flexibility on its shape and interconnect requirement to the empty space with the least packing flexibility in a greedy manner.Experimental results demonstrate that the algorithm,though simple,is quite effective in solving the problem.The same philosophy could also be used in designing efficient heuristics for other hard problems,such as placement with preplaced modules,placement with L/T shape modules,etc. 相似文献
3.
4.
5.
6.
7.
8.
提出了一种用于求解大规模VLSI模块布局问题的确定性方法.该方法在"最小自由度优先"原则的基础上,模拟人工布局过程提出了"分阶段布局"的思想.分阶段布局就是将布局过程按照布局完成的比例划分成若干个阶段,再将各种启发式策略适当地应用到各个阶段中,从而改善算法的整体性能.理论上,算法的时间复杂为(N1+N2)O(n2)+N3O(n4lgn),其中N1,N2,N3为各个阶段的模块数目,N1+N2+N3=n,且N3<<n,比原有的最小自由度优先算法复杂度O(n5lgn)小很多.实验结果也表明该方法很有潜力. 相似文献
9.
10.