A Shortest Path Algorithm for Edge-Sparse Graphs
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Global wiring on a wire routing machine
DAC '82 Proceedings of the 19th Design Automation Conference
Flows in Networks
Global Wiring by Simulated Annealing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Routing Techniques for Gate Array
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Practical Approximation Algorithms for Separable Packing Linear Programs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Proceedings of the 2009 International Conference on Computer-Aided Design
| Hi-index | 0.00 |
The paper describes a new global router applicable for any object with a defined channel structure. This router can be used for the routing of chips and boards with rectilinear or nonrectilinear channel topology in a multilayer environment. This makes it more universal than other known global routers. The router is based on a multicommodity flow model in the graph form with hierarchical cost function. This model is proved to be NP-complete. An algorithm applied to this problem is based on minimax ideas. It moves from the solution optimal w/r to an initial cost function in the direction of the constraints by maximizing on each iteration the decrease in the number of channels at the highest level of overflow and the number of cells with overflown via count. If a solution exists for each iteration, then algorithm will converge in polynomially bounded number of steps to the solution of the multicommodity flow problem. If, for some iteration, a solution does not exist, then an escape procedure is applied and the process continues. Experimental results indicate that performance characteristics of this global router are not inferior to global routers applicable only to gate arrays.