A global router based on a multicommodity flow model
Integration, the VLSI Journal
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Introduction to algorithms
Placement and routing tools for the Triptych FPGA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Provably good global routing by a new approximation algorithm for multicommodity flow
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Track assignment: a desirable intermediate step between global routing and detailed routing
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Improved global routing through congestion estimation
Proceedings of the 40th annual Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
Optimal routing algorithms for pin clusters in high-density multichip modules
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Efficient escape routing for hexagonal array of high density I/Os
Proceedings of the 43rd annual Design Automation Conference
A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
As the design complexities and circuit densities are increasing, the detailed routing (DR) problem is becoming a more and more challenging problem. Due to the high complexity of DR algorithms, it is very important to start the routing process with clean solutions, rather than starting with suboptimal routes and trying to fix them in iterative process. In this paper, we propose an escape routing algorithm that can optimize routing of a set of nets around their terminals. For this, we first propose a polynomial-time algorithm that guarantees to find the optimal escape routing solution for a set of nets when the track structures are uniform. Then, we use this algorithm as a baseline, and study the general problem with arbitrary track structures. For this, we propose a novel multi-commodity flow (MCF) model that has a one-to-one correspondence with the escape routing problem. This MCF model is novel in the sense that the inter-dependency and contention between different flow commodities is minimal. Using this model, we propose a Lagrangian-relaxation (LR) based algorithm to solve the escape problem. Our experiments demonstrate that this algorithm improves the overall routability significantly by reducing the number of nets that require rip-up and reroute.