基于禁忌搜索算法的VLSI布局

VLSI Placement Based on Tabu Search Algorithms

将禁忌搜索算法应用于VLSI门阵列的布局问题,建立了以总线长度和通道拥挤度的布局目标函数,用禁忌搜索算法求解目标函数的最小值,通过实验仿真,将本算法和遗传算法进行了比较,结果表明不论在解的质量和收敛速度方面,禁忌搜索算法优于遗传算法。

Tabu search algorithm is applied to the VLSI placement of gate array.The objective function is given which based on wire-length and the degree of channel crowded. The minimum value of objective function is solved by tabu search algorithm. And this algorithm is compared with the genetic algorithm in trial. The results show that this algorithm is better than the genetic algorithm in the convergence and quality of the solution.