BBL布局算法研究

Algorithm Research on VLSI Placement

摘要: 针对不可二划分结构的布局问题,在序列对的基础上,结合结群技术,利用禁忌搜索算法,以芯片面积和连线总长作为优化目标求解BBL布局问题.用两个规模较大的MCNC标准例子进行了测试,并与其他文献中的结果进行了比较.实验结果表明,文中算法是十分有效的.

Abstract: A placement algorithm is presented based on clustering technology and tabu search.The placement representation is employed by sequence pair which is an effective way to represent the nonslicing structure.Placement quality of this algorithm has been demonstrated by two standard examples of MCNC.Experimental results show that our algorithm is very promising.