Obstacle-Avoiding Switchbox Routers with Constraint Programming and Mixed Integer Linear Programming

• Main Authors: Che-I Lee, 李哲逸
• Other Authors: 曾奕倫
• Format: Others
• Language: en_US
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/78974880211200694306

碩士 === 元智大學 === 資訊工程學系 === 99 === Switchbox routing is a type of problems arising in the detailed routing phase of VLSI physical design automation. A switchbox is a rectangular area and its boundary contains a number of terminals; each terminal belongs to a specific net. A switchbox router can connect all the terminals belonging to the same net and the router must complete the connection of each net. It has been proven that a switchbox routing problem containing multiple terminals and multiple nets belongs to the class of NP-complete. In this thesis, we present a constraint programming (CP) formulation and a mixed integer linear programming (MILP) formulation to switchbox routing problems. Therefore, CP solvers and MILP solvers can be used to find solutions. Experimental results show that more than 84X speed-up can be achieved by using a parallel MILP solver with 16 threads. The execution time can be further reduced when a computer containing more processor cores is available.