Pin Assignment for Wire Length Minimization after Floorplanning Phase

摘要：

In this paper,we present a pin assignment algorithm which can be applied after floorplanning phase for wire length optimization.In order to reassign pins globally for all the nets,we formulate a Mixed Integer Linear Programming (MILP)for this problem.Since the MILP problem is a NP-hard problem,and the solution space is on a large scale,we introduce a simulated annealing algorithm to solve the MILP problem. The results show that our algorithm can further reduce the wire length by 10.22% within less than one minute averagely.

关键词： Pin assignment post-floorplanning wire length minimization MILP simulated annealing

作者: Xu He Sheqin Dong

作者单位: Tsinghua National Laboratory for Information Science & Technology,China,100084

会议类型: 国际会议

会议名称: 2009 IEEE 8th International Conference on ASIC(第八届IEEE国际专用集成电路大会)

会议地点: 长沙

会议语种:英文

页码: 1294-1297

在线出版日期: 2009-10-20（万方平台首次上网日期，不代表论文的发表时间）