A multi-layer area routing algorithm with optimized pin mapping strategy

In this paper, we present a new multi-layer area routing algorithm with optimized pin mapping strategy. The algorithm can handle large routing problems, in which terminals and obstacles arbitrarily located in the routing area. An optimized pin mapping strategy is proposed in this paper as a pre-process before routing. We use the best matching of a bipartite graph to solve the pin-mapping problem. We tested our algorithm on a set of benchmark examples and compared our routing results with the results without pin-optimized mapping. Experiment results show that, the algorithm efficiently shortens the total wire length greatly and increases the routing completion rate.