A Method for the Solution of the Nth Best Path Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimising automatic tracking of multilayer boards
ACM SIGDA Newsletter
Performance of interconnection rip-up and reroute strategies
DAC '81 Proceedings of the 18th Design Automation Conference
TWIGY - a topological algorithm based routing system
DAC '81 Proceedings of the 18th Design Automation Conference
A line-expansion algorithm for the general routing problem with a guaranteed solution
DAC '80 Proceedings of the 17th Design Automation Conference
Hardware support for automatic routing
DAC '82 Proceedings of the 19th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
Automated rip-up and reroute techniques
DAC '82 Proceedings of the 19th Design Automation Conference
MOLE: a sea-of-gates detailed router
EURO-DAC '90 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
In this paper we describe a router which has the capabilities of automatic rip-up and rerouting. The system employs a “look-ahead” feature for determining if as yet unrouted nets are unroutable. Backtrack programming is used to implement an implicit enumeration scheme which sequentially produces alternative paths for a given net. The relationship between this type of router and the problem of ordering nets is discussed. By varying parameters in our router which deal with back tracking and path-length deviations, we can obtain a hierarchy of routing systems. One extreme case corresponds to a classical Lee-type router; another to a “perfect” router which guarantees finding a solution if one exists.