时间：2018年2月2日上午10:00-11:00

 

地点：学院4栋229报告厅

 

 

题目：A Hyper-graph Bi-partitioning Algorithm of VLSI Circuits Using Ant Colony Optimization

 

摘要：The VLSI circuit bi-partitioning problem is NP hard. We use ant colony optimization to solve the problem on 

 

the basis of F-M algorithm. We add relax of gain and area, punish the less gain cells by lowering their pheromone 

 

concentration, optimize the moving selection of cells using heuristic knowledge. To verify the correctness of the 

 

optimal solution and the area restriction, we re-compute using the set of result solutions as the set of initial 

 

solutions after partitioning computing. We use eighteen ISPD98 standard circuits to test the capability under the 

 

restriction of area factor is 2% and 10% individually. The minimum cuts of seven circuits 

 

（ibm01,ibm02,ibm03,ibm05,ibm06,ibm08,ibm10）are comparative or more superior to that of the hMetis algorithm. The 

 

average of the minimum cuts of the eighteen circuits is better than that of the hMetis algorithm.