求解VLSI不可二划分布图规划问题的混合遗传算法

A hybrid genetic algorithm for non-slicing VLSI floorplanning

超大规模集成电路(VLSI)布图规划是VLSI物理设计的关键环节之一,对集成电路的芯片面积、线长等性能指标有重大影响.基于B*-tree的结构表示,结合遗传算法的思想,提出一种用于解决VLSI不可二划分布图规划问题的混合遗传算法,并用MCNC标准测试例子对所设计的算法进行测试,证明该算法的有效性.

Floorplanning is a crucial step in very large scale integration （VLSI） physical design,because it affects chip area and wirelength of a design.With the B＊-tree representation,a hybrid genetic algorithm for the non-slicing VLSI floorplanning is presented.Experimental results on MCNC benchmarks show that the hybrid genetic algorithm is effective.