Introduction to algorithms
A global router using an efficient approximate multicommodity multiterminal flow algorithm
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Finding minimum-cost flows by double scaling
Mathematical Programming: Series A and B
An efficient timing-driven global routing algorithm
DAC '93 Proceedings of the 30th international Design Automation Conference
A new approach to the pin assignment problem
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Provably good global routing by a new approximation algorithm for multicommodity flow
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Pin assignment on a printed circuit board
DAC '78 Proceedings of the 15th Design Automation Conference
Pin assignment in automated printed circuit board design
DAC '72 Proceedings of the 9th Design Automation Workshop
Four-bend top-down global routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Multilayer pin assignment for macro cell circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Simultaneous escape routing and layer assignment for dense PCBs
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Pin assignment using stochastic local search constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Computer-aided design for microfluidic chips based on multilayer soft lithography
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
POMR: a power-aware interconnect optimization methodology
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
Macro-block pin assignment and routing are important tasks in physical design planning. Existing algorithms for these problems can be classified into two categories: 1) a two-step approach where pin assignment is followed by routing, and 2) a net-by-net approach where pin assignment and routing for a single net are performed simultaneously. None of the existing algorithms is "exact" in the sense that the algorithm may fail to route all nets even though a feasible solution exists. This remains to be true even if only 2-pin nets between two blocks are concerned. In this paper, we present the first polynomial-time exact algorithm for simultaneous pin assignment and routing for 2-pin nets from one block (source block) to all other blocks. In addition to finding a feasible solution whenever one exists, it guarantees to find a pin-assignment/routing solution with minimum cost α · W + β · V, where W is the total wirelength and V is the total number of vias. Our algorithm has various applications: 1) It is suitable in ECO (Engineering Change Order) situations where a designer wants to incrementally modify the existing solution instead of redoing everything after a design change. 2) Given any pin assignment and routing solution obtained by any existing method, our algorithm can be used to increase the number of routed nets and reduce the routing cost. Furthermore, it provides an efficient algorithm for the pin assignment and routing problem of all blocks. The method is applicable to both global and detailed routing with arbitrary routing obstacles on multiple layers. Experimental results demonstrate its efficiency and effectiveness.